Base | Representation |
---|---|
bin | 11001000000101111010110… |
… | …110110110110100000001011 |
3 | 112102111002102100201010100202 |
4 | 121000233112312312200023 |
5 | 103404233110100333344 |
6 | 1025542120550322415 |
7 | 32112245256334040 |
oct | 3100572666664013 |
9 | 472432370633322 |
10 | 110002012121099 |
11 | 3206065610659a |
12 | 1040716335940b |
13 | 494c1b7100967 |
14 | 1d241a92731c7 |
15 | cab6111bb94e |
hex | 640bd6db680b |
110002012121099 has 16 divisors (see below), whose sum is σ = 132336038714880. Its totient is φ = 89323058214720.
The previous prime is 110002012121059. The next prime is 110002012121159. The reversal of 110002012121099 is 990121210200011.
It is a cyclic number.
It is not a de Polignac number, because 110002012121099 - 28 = 110002012120843 is a prime.
It is a super-2 number, since 2×1100020121210992 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110002012121039) 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 in 15 ways as a sum of consecutive naturals, for example, 2375042 + ... + 15021479.
It is an arithmetic number, because the mean of its divisors is an integer number (8271002419680).
Almost surely, 2110002012121099 is an apocalyptic number.
110002012121099 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
110002012121099 is a deficient number, since it is larger than the sum of its proper divisors (22334026593781).
110002012121099 is a wasteful number, since it uses less digits than its factorization.
110002012121099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17444090.
The product of its (nonzero) digits is 648, while the sum is 29.
The spelling of 110002012121099 in words is "one hundred ten trillion, two billion, twelve million, one hundred twenty-one thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •