Base | Representation |
---|---|
bin | 10110101111001101001101… |
… | …010110001101010011101001 |
3 | 111010002000010002220212212101 |
4 | 112233031031112031103221 |
5 | 101101404042413020243 |
6 | 552403500203013401 |
7 | 30030556346313241 |
oct | 2657151526152351 |
9 | 433060102825771 |
10 | 100001021220073 |
11 | 29955216503a06 |
12 | b270a4b80a261 |
13 | 43a50958a298c |
14 | 1a9a10a6c4b21 |
15 | b863c929354d |
hex | 5af34d58d4e9 |
100001021220073 has 2 divisors, whose sum is σ = 100001021220074. Its totient is φ = 100001021220072.
The previous prime is 100001021220011. The next prime is 100001021220077. The reversal of 100001021220073 is 370022120100001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96049565038144 + 3951456181929 = 9800488^2 + 1987827^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001021220073 - 213 = 100001021211881 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100001021220073.
It is not a weakly prime, because it can be changed into another prime (100001021220077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000510610036 + 50000510610037.
It is an arithmetic number, because the mean of its divisors is an integer number (50000510610037).
Almost surely, 2100001021220073 is an apocalyptic number.
It is an amenable number.
100001021220073 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001021220073 is an equidigital number, since it uses as much as digits as its factorization.
100001021220073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 100001021220073 its reverse (370022120100001), we get a palindrome (470023141320074).
The spelling of 100001021220073 in words is "one hundred trillion, one billion, twenty-one million, two hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •