Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010011101111010110110001 |
3 | 111010110112000112222111022202 |
4 | 112300303221103233112301 |
5 | 101110204323033014301 |
6 | 552530210343112545 |
7 | 30041532126446435 |
oct | 2660635123572661 |
9 | 433415015874282 |
10 | 100111012001201 |
11 | 29997929427813 |
12 | b28a227442755 |
13 | 43b25741c2716 |
14 | 1aa15825889c5 |
15 | b891b566966b |
hex | 5b0ce94ef5b1 |
100111012001201 has 2 divisors, whose sum is σ = 100111012001202. Its totient is φ = 100111012001200.
The previous prime is 100111012001173. The next prime is 100111012001251. The reversal of 100111012001201 is 102100210111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 66596453242225 + 33514558758976 = 8160665^2 + 5789176^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111012001201 - 210 = 100111012000177 is a prime.
It is a super-2 number, since 2×1001110120012012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100111012001251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055506000600 + 50055506000601.
It is an arithmetic number, because the mean of its divisors is an integer number (50055506000601).
Almost surely, 2100111012001201 is an apocalyptic number.
It is an amenable number.
100111012001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111012001201 is an equidigital number, since it uses as much as digits as its factorization.
100111012001201 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 11.
Adding to 100111012001201 its reverse (102100210111001), we get a palindrome (202211222112202).
The spelling of 100111012001201 in words is "one hundred trillion, one hundred eleven billion, twelve million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •