Base | Representation |
---|---|
bin | 10110111111011111100001… |
… | …101110001001010010000101 |
3 | 111021000222220202001020120102 |
4 | 112333133201232021102011 |
5 | 101223223133204114343 |
6 | 555021551323413445 |
7 | 30204456605203223 |
oct | 2677374156112205 |
9 | 437028822036512 |
10 | 101120202019973 |
11 | 2a246922929844 |
12 | b411933084285 |
13 | 445679540c696 |
14 | 1ad835b34bb13 |
15 | ba557dae43b8 |
hex | 5bf7e1b89485 |
101120202019973 has 2 divisors, whose sum is σ = 101120202019974. Its totient is φ = 101120202019972.
The previous prime is 101120202019919. The next prime is 101120202020011. The reversal of 101120202019973 is 379910202021101.
It is a happy number.
It is an a-pointer prime, because the next prime (101120202020011) can be obtained adding 101120202019973 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76048480654084 + 25071721365889 = 8720578^2 + 5007167^2 .
It is a cyclic number.
It is not a de Polignac number, because 101120202019973 - 220 = 101120200971397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101120202019273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560101009986 + 50560101009987.
It is an arithmetic number, because the mean of its divisors is an integer number (50560101009987).
Almost surely, 2101120202019973 is an apocalyptic number.
It is an amenable number.
101120202019973 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120202019973 is an equidigital number, since it uses as much as digits as its factorization.
101120202019973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 38.
The spelling of 101120202019973 in words is "one hundred one trillion, one hundred twenty billion, two hundred two million, nineteen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •