Base | Representation |
---|---|
bin | 10110101111001110001000… |
… | …011010100000000000111101 |
3 | 111010002002200011121221011110 |
4 | 112233032020122200000331 |
5 | 101101413110110413041 |
6 | 552404142403112233 |
7 | 30030623041441440 |
oct | 2657161032400075 |
9 | 433062604557143 |
10 | 100002012201021 |
11 | 29955684927627 |
12 | b271087672679 |
13 | 43a51c2ca2938 |
14 | 1a9a1a2165657 |
15 | b86436292516 |
hex | 5af3886a003d |
100002012201021 has 8 divisors (see below), whose sum is σ = 152384018592064. Its totient is φ = 57144006972000.
The previous prime is 100002012200921. The next prime is 100002012201053. The reversal of 100002012201021 is 120102210200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100002012201021 - 29 = 100002012200509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100002012200988 and 100002012201006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002012201071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2381000290480 + ... + 2381000290521.
It is an arithmetic number, because the mean of its divisors is an integer number (19048002324008).
Almost surely, 2100002012201021 is an apocalyptic number.
It is an amenable number.
100002012201021 is a deficient number, since it is larger than the sum of its proper divisors (52382006391043).
100002012201021 is an equidigital number, since it uses as much as digits as its factorization.
100002012201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4762000581011.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100002012201021 its reverse (120102210200001), we get a palindrome (220104222401022).
The spelling of 100002012201021 in words is "one hundred trillion, two billion, twelve million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •