Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …010101110110000000100001 |
3 | 111010010001110221121221221110 |
4 | 112233113130111312000201 |
5 | 101102044044102413441 |
6 | 552412514435013533 |
7 | 30031425563153664 |
oct | 2657273425660041 |
9 | 433101427557843 |
10 | 100012010201121 |
11 | 299599454a6027 |
12 | b272bb7a3a2a9 |
13 | 43a612743ca25 |
14 | 1a9a86dd276db |
15 | b8681dda7b16 |
hex | 5af5dc576021 |
100012010201121 has 8 divisors (see below), whose sum is σ = 136953383338624. Its totient is φ = 64872655265520.
The previous prime is 100012010201119. The next prime is 100012010201177. The reversal of 100012010201121 is 121102010210001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100012010201121 - 21 = 100012010201119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100012010201097 and 100012010201106.
It is not an unprimeable number, because it can be changed into a prime (100012010201101) 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, 450504550345 + ... + 450504550566.
It is an arithmetic number, because the mean of its divisors is an integer number (17119172917328).
Almost surely, 2100012010201121 is an apocalyptic number.
It is an amenable number.
100012010201121 is a deficient number, since it is larger than the sum of its proper divisors (36941373137503).
100012010201121 is an equidigital number, since it uses as much as digits as its factorization.
100012010201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 901009100951.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100012010201121 its reverse (121102010210001), we get a palindrome (221114020411122).
The spelling of 100012010201121 in words is "one hundred trillion, twelve billion, ten million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •