Base | Representation |
---|---|
bin | 10110101111010101100101… |
… | …101110010010110111111111 |
3 | 111010002212100020221110202110 |
4 | 112233111211232102313333 |
5 | 101102031010122401421 |
6 | 552411545144425103 |
7 | 30031325346602241 |
oct | 2657254556226777 |
9 | 433085306843673 |
10 | 100010020122111 |
11 | 29959014115230 |
12 | b272741478193 |
13 | 43a5b9b05a298 |
14 | 1a9a7218d2091 |
15 | b86754304a76 |
hex | 5af565b92dff |
100010020122111 has 32 divisors (see below), whose sum is σ = 146448287136000. Its totient is φ = 60204163092480.
The previous prime is 100010020122107. The next prime is 100010020122163. The reversal of 100010020122111 is 111221020010001.
It is not a de Polignac number, because 100010020122111 - 22 = 100010020122107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100010020142111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 296124735 + ... + 296462271.
It is an arithmetic number, because the mean of its divisors is an integer number (4576508973000).
Almost surely, 2100010020122111 is an apocalyptic number.
100010020122111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100010020122111 is a deficient number, since it is larger than the sum of its proper divisors (46438267013889).
100010020122111 is a wasteful number, since it uses less digits than its factorization.
100010020122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397959.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100010020122111 its reverse (111221020010001), we get a palindrome (211231040132112).
The spelling of 100010020122111 in words is "one hundred trillion, ten billion, twenty million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •