Base | Representation |
---|---|
bin | 10110110000110100110001… |
… | …011011100001011110110001 |
3 | 111010110122010212210212002211 |
4 | 112300310301123201132301 |
5 | 101110214312313013243 |
6 | 552530530405412121 |
7 | 30041604121334032 |
oct | 2660646133413661 |
9 | 433418125725084 |
10 | 100112222001073 |
11 | 2999839a443607 |
12 | b28a50470a041 |
13 | 43b2707aa8689 |
14 | 1aa165915ca89 |
15 | b892369ccd9d |
hex | 5b0d316e17b1 |
100112222001073 has 2 divisors, whose sum is σ = 100112222001074. Its totient is φ = 100112222001072.
The previous prime is 100112222001031. The next prime is 100112222001119. The reversal of 100112222001073 is 370100222211001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 63895994289009 + 36216227712064 = 7993497^2 + 6017992^2 .
It is an emirp because it is prime and its reverse (370100222211001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100112222001073 - 221 = 100112219903921 is a prime.
It is not a weakly prime, because it can be changed into another prime (100112222001013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50056111000536 + 50056111000537.
It is an arithmetic number, because the mean of its divisors is an integer number (50056111000537).
Almost surely, 2100112222001073 is an apocalyptic number.
It is an amenable number.
100112222001073 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112222001073 is an equidigital number, since it uses as much as digits as its factorization.
100112222001073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 100112222001073 its reverse (370100222211001), we get a palindrome (470212444212074).
The spelling of 100112222001073 in words is "one hundred trillion, one hundred twelve billion, two hundred twenty-two million, one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •