Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …011001101001111001111001 |
3 | 111010010001111000111201022110 |
4 | 112233113130121221321321 |
5 | 101102044044331400441 |
6 | 552412514512242533 |
7 | 30031425604514346 |
oct | 2657273431517171 |
9 | 433101430451273 |
10 | 100012011200121 |
11 | 29959946018649 |
12 | b272bb8240449 |
13 | 43a61276cc657 |
14 | 1a9a8701077cd |
15 | b8681e003b16 |
hex | 5af5dc669e79 |
100012011200121 has 64 divisors (see below), whose sum is σ = 137980241715456. Its totient is φ = 64388431872000.
The previous prime is 100012011200089. The next prime is 100012011200161. The reversal of 100012011200121 is 121002110210001.
It is not a de Polignac number, because 100012011200121 - 25 = 100012011200089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100012011200097 and 100012011200106.
It is not an unprimeable number, because it can be changed into a prime (100012011200161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11679548586 + ... + 11679557148.
It is an arithmetic number, because the mean of its divisors is an integer number (2155941276804).
Almost surely, 2100012011200121 is an apocalyptic number.
It is an amenable number.
100012011200121 is a deficient number, since it is larger than the sum of its proper divisors (37968230515335).
100012011200121 is a wasteful number, since it uses less digits than its factorization.
100012011200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10282.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100012011200121 its reverse (121002110210001), we get a palindrome (221014121410122).
The spelling of 100012011200121 in words is "one hundred trillion, twelve billion, eleven million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •