Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000111000000001000010101 |
3 | 111010002000022200021012222201 |
4 | 112233031102013000020111 |
5 | 101101404223341320041 |
6 | 552403512135324501 |
7 | 30030561336411553 |
oct | 2657152207001025 |
9 | 433060280235881 |
10 | 100001101120021 |
11 | 29955257616a22 |
12 | b270a72520731 |
13 | 43a50a92c965a |
14 | 1a9a117162bd3 |
15 | b863d12c7631 |
hex | 5af3521c0215 |
100001101120021 has 2 divisors, whose sum is σ = 100001101120022. Its totient is φ = 100001101120020.
The previous prime is 100001101120009. The next prime is 100001101120049. The reversal of 100001101120021 is 120021101100001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58075281869796 + 41925819250225 = 7620714^2 + 6475015^2 .
It is an emirp because it is prime and its reverse (120021101100001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100001101120021 - 29 = 100001101119509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100001101120001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000550560010 + 50000550560011.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550560011).
Almost surely, 2100001101120021 is an apocalyptic number.
It is an amenable number.
100001101120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001101120021 is an equidigital number, since it uses as much as digits as its factorization.
100001101120021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100001101120021 its reverse (120021101100001), we get a palindrome (220022202220022).
The spelling of 100001101120021 in words is "one hundred trillion, one billion, one hundred one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •