Base | Representation |
---|---|
bin | 1001000110001100011011… |
… | …1110110100000110111011 |
3 | 1022102011222010101200110112 |
4 | 2101203012332310012323 |
5 | 2302333120142021334 |
6 | 33134510544134535 |
7 | 2051423302053131 |
oct | 221430676640673 |
9 | 38364863350415 |
10 | 10002022220219 |
11 | 3206919877aa7 |
12 | 115656100744b |
13 | 5772570b2733 |
14 | 26815992d751 |
15 | 1252977444ce |
hex | 918c6fb41bb |
10002022220219 has 2 divisors, whose sum is σ = 10002022220220. Its totient is φ = 10002022220218.
The previous prime is 10002022220207. The next prime is 10002022220243. The reversal of 10002022220219 is 91202222020001.
It is a weak prime.
It is an emirp because it is prime and its reverse (91202222020001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002022220219 is a prime.
It is a super-2 number, since 2×100020222202192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10002022220194 and 10002022220203.
It is not a weakly prime, because it can be changed into another prime (10002022420219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001011110109 + 5001011110110.
It is an arithmetic number, because the mean of its divisors is an integer number (5001011110110).
Almost surely, 210002022220219 is an apocalyptic number.
10002022220219 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002022220219 is an equidigital number, since it uses as much as digits as its factorization.
10002022220219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
The spelling of 10002022220219 in words is "ten trillion, two billion, twenty-two million, two hundred twenty thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •