## 69481

69,481 (sixty-nine thousand four hundred eighty-one) is an odd five-digits prime number following 69480 and preceding 69482. In scientific notation, it is written as 6.9481 × 104. The sum of its digits is 28. It has a total of 1 prime factor and 2 positive divisors. There are 69,480 positive integers (up to 69481) that are relatively prime to 69481.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 5
• Sum of Digits 28
• Digital Root 1

## Name

Short name 69 thousand 481 sixty-nine thousand four hundred eighty-one

## Notation

Scientific notation 6.9481 × 104 69.481 × 103

## Prime Factorization of 69481

Prime Factorization 69481

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 69481 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 11.1488 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 69,481 is 69481. Since it has a total of 1 prime factor, 69,481 is a prime number.

## Divisors of 69481

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 69482 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 34741 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 263.592 Returns the nth root of the product of n divisors H(n) 1.99997 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 69,481 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 69,481) is 69,482, the average is 34,741.

## Other Arithmetic Functions (n = 69481)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 69480 Total number of positive integers not greater than n that are coprime to n λ(n) 69480 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 6897 Total number of primes less than or equal to n r2(n) 8 The number of ways n can be represented as the sum of 2 squares

There are 69,480 positive integers (less than 69,481) that are coprime with 69,481. And there are approximately 6,897 prime numbers less than or equal to 69,481.

## Divisibility of 69481

 m n mod m 2 3 4 5 6 7 8 9 1 1 1 1 1 6 1 1

69,481 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (69481)

Base System Value
2 Binary 10000111101101001
3 Ternary 10112022101
4 Quaternary 100331221
5 Quinary 4210411
6 Senary 1253401
8 Octal 207551
10 Decimal 69481
12 Duodecimal 34261
20 Vigesimal 8de1
36 Base36 1hm1

## Basic calculations (n = 69481)

### Multiplication

n×i
 n×2 138962 208443 277924 347405

### Division

ni
 n⁄2 34740.5 23160.3 17370.2 13896.2

### Exponentiation

ni
 n2 4827609361 335427126011641 23305812142414828321 1619311133467124686571401

### Nth Root

i√n
 2√n 263.592 41.1107 16.2355 9.29765

## 69481 as geometric shapes

### Circle

 Diameter 138962 436562 1.51664e+10

### Sphere

 Volume 1.40503e+15 6.06655e+10 436562

### Square

Length = n
 Perimeter 277924 4.82761e+09 98261

### Cube

Length = n
 Surface area 2.89657e+10 3.35427e+14 120345

### Equilateral Triangle

Length = n
 Perimeter 208443 2.09042e+09 60172.3

### Triangular Pyramid

Length = n
 Surface area 8.36166e+09 3.95305e+13 56731

## Cryptographic Hash Functions

md5 8cff407833605a335be4b0048d8504e3 492cb3837043be4ded4aa30517091466ab5494ac e5b9348959428c8e92d59b757174f78bfcdea92c151a2470a01b25af9dd869c8 4dd502bbfd14d0a553d90a365d856031764e63b9c20af70c9122d9deb169c0583d433eb062ce324e9efc37752b9cf77c1198b79b44e4894c678be01d973d7db3 c9af9316edd5a38a9869364939bf6dd912057386
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}