Base | Representation |
---|---|
bin | 1001101101101011101011… |
… | …0110010110111110000001 |
3 | 1101211001001002002220200000 |
4 | 2123122322312112332001 |
5 | 2344442001404304024 |
6 | 34414304022150213 |
7 | 2151430564633530 |
oct | 233327266267601 |
9 | 41731032086600 |
10 | 10680423509889 |
11 | 34485a66a6971 |
12 | 1245b30282369 |
13 | 5c620c8a0cb3 |
14 | 28cd144b2317 |
15 | 137c50538cc9 |
hex | 9b6bad96f81 |
10680423509889 has 48 divisors (see below), whose sum is σ = 18284874491520. Its totient is φ = 6102867939840.
The previous prime is 10680423509879. The next prime is 10680423509909. The reversal of 10680423509889 is 98890532408601.
10680423509889 is a `hidden beast` number, since 1 + 0 + 6 + 8 + 0 + 42 + 3 + 509 + 8 + 89 = 666.
It is not a de Polignac number, because 10680423509889 - 213 = 10680423501697 is a prime.
It is a super-2 number, since 2×106804235098892 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (10680423509849) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 51336127 + ... + 51543755.
It is an arithmetic number, because the mean of its divisors is an integer number (380934885240).
Almost surely, 210680423509889 is an apocalyptic number.
It is an amenable number.
10680423509889 is a deficient number, since it is larger than the sum of its proper divisors (7604450981631).
10680423509889 is an equidigital number, since it uses as much as digits as its factorization.
10680423509889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237892 (or 237880 counting only the distinct ones).
The product of its (nonzero) digits is 29859840, while the sum is 63.
The spelling of 10680423509889 in words is "ten trillion, six hundred eighty billion, four hundred twenty-three million, five hundred nine thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •