Base | Representation |
---|---|
bin | 101101111100111100011000… |
… | …110010111100001100011011 |
3 | 222111120120200121021111101112 |
4 | 231330330120302330030123 |
5 | 202442202002120321334 |
6 | 1553455301042210535 |
7 | 60366151634643632 |
oct | 5574743062741433 |
9 | 874516617244345 |
10 | 202100102120219 |
11 | 594391989a9706 |
12 | 1a80042b353a4b |
13 | 889cc5b539544 |
14 | 37c99a8d18519 |
15 | 185714a2294ce |
hex | b7cf18cbc31b |
202100102120219 has 2 divisors, whose sum is σ = 202100102120220. Its totient is φ = 202100102120218.
The previous prime is 202100102120149. The next prime is 202100102120291. The reversal of 202100102120219 is 912021201001202.
Together with next prime (202100102120291) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202100102120219 - 28 = 202100102119963 is a prime.
It is a super-2 number, since 2×2021001021202192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202100102120194 and 202100102120203.
It is not a weakly prime, because it can be changed into another prime (202100102128219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101050051060109 + 101050051060110.
It is an arithmetic number, because the mean of its divisors is an integer number (101050051060110).
Almost surely, 2202100102120219 is an apocalyptic number.
202100102120219 is a deficient number, since it is larger than the sum of its proper divisors (1).
202100102120219 is an equidigital number, since it uses as much as digits as its factorization.
202100102120219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 202100102120219 in words is "two hundred two trillion, one hundred billion, one hundred two million, one hundred twenty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •