Base | Representation |
---|---|
bin | 10110101111010111101000… |
… | …111010110100010110000111 |
3 | 111010010002000122200211202001 |
4 | 112233113220322310112013 |
5 | 101102100012113021411 |
6 | 552412551413530131 |
7 | 30031434034614025 |
oct | 2657275072642607 |
9 | 433102018624661 |
10 | 100012221220231 |
11 | 29959a43624891 |
12 | b273056643947 |
13 | 43a615c0846c8 |
14 | 1a9a88dd77715 |
15 | b8683268bdc1 |
hex | 5af5e8eb4587 |
100012221220231 has 2 divisors, whose sum is σ = 100012221220232. Its totient is φ = 100012221220230.
The previous prime is 100012221220157. The next prime is 100012221220277. The reversal of 100012221220231 is 132022122210001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100012221220231 - 221 = 100012219123079 is a prime.
It is a super-2 number, since 2×1000122212202312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100012221220199 and 100012221220208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100012221220031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50006110610115 + 50006110610116.
It is an arithmetic number, because the mean of its divisors is an integer number (50006110610116).
Almost surely, 2100012221220231 is an apocalyptic number.
100012221220231 is a deficient number, since it is larger than the sum of its proper divisors (1).
100012221220231 is an equidigital number, since it uses as much as digits as its factorization.
100012221220231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 100012221220231 its reverse (132022122210001), we get a palindrome (232034343430232).
The spelling of 100012221220231 in words is "one hundred trillion, twelve billion, two hundred twenty-one million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •