Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …110011100101001000000001 |
3 | 111010110112022011002202221011 |
4 | 112300303233303211020001 |
5 | 101110210033434324301 |
6 | 552530225235400521 |
7 | 30041534622146026 |
oct | 2660635763451001 |
9 | 433415264082834 |
10 | 100111121011201 |
11 | 29997984a12623 |
12 | b28a257a53141 |
13 | 43b259096c291 |
14 | 1aa1592c4354d |
15 | b891beeeda51 |
hex | 5b0cefce5201 |
100111121011201 has 2 divisors, whose sum is σ = 100111121011202. Its totient is φ = 100111121011200.
The previous prime is 100111121011189. The next prime is 100111121011229. The reversal of 100111121011201 is 102110121111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81586489810576 + 18524631200625 = 9032524^2 + 4304025^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111121011201 - 221 = 100111118914049 is a prime.
It is not a weakly prime, because it can be changed into another prime (100111121011901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055560505600 + 50055560505601.
It is an arithmetic number, because the mean of its divisors is an integer number (50055560505601).
Almost surely, 2100111121011201 is an apocalyptic number.
It is an amenable number.
100111121011201 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111121011201 is an equidigital number, since it uses as much as digits as its factorization.
100111121011201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 100111121011201 its reverse (102110121111001), we get a palindrome (202221242122202).
The spelling of 100111121011201 in words is "one hundred trillion, one hundred eleven billion, one hundred twenty-one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •