Base | Representation |
---|---|
bin | 1001110101001011010000… |
… | …1110000010110011011111 |
3 | 1102021100100000222002212201 |
4 | 2131102310032002303133 |
5 | 2404044130243001434 |
6 | 34553354331512331 |
7 | 2163636044031343 |
oct | 235226416026337 |
9 | 42240300862781 |
10 | 10809161297119 |
11 | 3498159837949 |
12 | 1266a7a2b86a7 |
13 | 6053b810b163 |
14 | 295248095623 |
15 | 13b287673614 |
hex | 9d4b4382cdf |
10809161297119 has 2 divisors, whose sum is σ = 10809161297120. Its totient is φ = 10809161297118.
The previous prime is 10809161297113. The next prime is 10809161297183. The reversal of 10809161297119 is 91179216190801.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10809161297119 - 27 = 10809161296991 is a prime.
It is a super-2 number, since 2×108091612971192 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10809161297119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10809161297113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5404580648559 + 5404580648560.
It is an arithmetic number, because the mean of its divisors is an integer number (5404580648560).
Almost surely, 210809161297119 is an apocalyptic number.
10809161297119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10809161297119 is an equidigital number, since it uses as much as digits as its factorization.
10809161297119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 489888, while the sum is 55.
The spelling of 10809161297119 in words is "ten trillion, eight hundred nine billion, one hundred sixty-one million, two hundred ninety-seven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •