Base | Representation |
---|---|
bin | 10111001100100111011001… |
… | …101011010110010000110101 |
3 | 111101020012122022020110001122 |
4 | 113030213121223112100311 |
5 | 101333012034102414031 |
6 | 1000552133042433325 |
7 | 30326563343234042 |
oct | 2714473153262065 |
9 | 441205568213048 |
10 | 102022010201141 |
11 | 2a564323060938 |
12 | b538670962845 |
13 | 44c0832691574 |
14 | 1b29c6a93a1c9 |
15 | bbdc5ec4347b |
hex | 5cc9d9ad6435 |
102022010201141 has 2 divisors, whose sum is σ = 102022010201142. Its totient is φ = 102022010201140.
The previous prime is 102022010201117. The next prime is 102022010201159. The reversal of 102022010201141 is 141102010220201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86583955502500 + 15438054698641 = 9305050^2 + 3929129^2 .
It is an emirp because it is prime and its reverse (141102010220201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102022010201141 - 26 = 102022010201077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102022010201191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51011005100570 + 51011005100571.
It is an arithmetic number, because the mean of its divisors is an integer number (51011005100571).
Almost surely, 2102022010201141 is an apocalyptic number.
It is an amenable number.
102022010201141 is a deficient number, since it is larger than the sum of its proper divisors (1).
102022010201141 is an equidigital number, since it uses as much as digits as its factorization.
102022010201141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102022010201141 its reverse (141102010220201), we get a palindrome (243124020421342).
The spelling of 102022010201141 in words is "one hundred two trillion, twenty-two billion, ten million, two hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •