Base | Representation |
---|---|
bin | 10110110000110100101010… |
… | …001101111100011111110001 |
3 | 111010110121211110010102111002 |
4 | 112300310222031330133301 |
5 | 101110214040324014301 |
6 | 552530510404131345 |
7 | 30041601122006522 |
oct | 2660645215743761 |
9 | 433417743112432 |
10 | 100112101001201 |
11 | 29998338109613 |
12 | b28a490096b55 |
13 | 43b26b89c1613 |
14 | 1aa1647062849 |
15 | b8922b07b16b |
hex | 5b0d2a37c7f1 |
100112101001201 has 2 divisors, whose sum is σ = 100112101001202. Its totient is φ = 100112101001200.
The previous prime is 100112101001183. The next prime is 100112101001219. The reversal of 100112101001201 is 102100101211001.
It is a balanced prime because it is at equal distance from previous prime (100112101001183) and next prime (100112101001219).
It can be written as a sum of positive squares in only one way, i.e., 99127431788176 + 984669213025 = 9956276^2 + 992305^2 .
It is a cyclic number.
It is not a de Polignac number, because 100112101001201 - 26 = 100112101001137 is a prime.
It is not a weakly prime, because it can be changed into another prime (100112101001281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50056050500600 + 50056050500601.
It is an arithmetic number, because the mean of its divisors is an integer number (50056050500601).
Almost surely, 2100112101001201 is an apocalyptic number.
It is an amenable number.
100112101001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112101001201 is an equidigital number, since it uses as much as digits as its factorization.
100112101001201 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 100112101001201 its reverse (102100101211001), we get a palindrome (202212202212202).
The spelling of 100112101001201 in words is "one hundred trillion, one hundred twelve billion, one hundred one million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •