Base | Representation |
---|---|
bin | 10110110000110100110000… |
… | …001000000011011011000001 |
3 | 111010110122002100122011220202 |
4 | 112300310300020003123001 |
5 | 101110214241212320001 |
6 | 552530524304414545 |
7 | 30041603434341566 |
oct | 2660646010033301 |
9 | 433418070564822 |
10 | 100112200120001 |
11 | 29998389058a83 |
12 | b28a4b9317455 |
13 | 43b27033b6cb4 |
14 | 1aa16562a486d |
15 | b89234b0996b |
hex | 5b0d302036c1 |
100112200120001 has 2 divisors, whose sum is σ = 100112200120002. Its totient is φ = 100112200120000.
The previous prime is 100112200119977. The next prime is 100112200120067. The reversal of 100112200120001 is 100021002211001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83458292073601 + 16653908046400 = 9135551^2 + 4080920^2 .
It is a cyclic number.
It is not a de Polignac number, because 100112200120001 - 246 = 29743455942337 is a prime.
It is a super-2 number, since 2×1001122001200012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100112200120501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50056100060000 + 50056100060001.
It is an arithmetic number, because the mean of its divisors is an integer number (50056100060001).
Almost surely, 2100112200120001 is an apocalyptic number.
It is an amenable number.
100112200120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112200120001 is an equidigital number, since it uses as much as digits as its factorization.
100112200120001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100112200120001 its reverse (100021002211001), we get a palindrome (200133202331002).
The spelling of 100112200120001 in words is "one hundred trillion, one hundred twelve billion, two hundred million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •