Base | Representation |
---|---|
bin | 1001010010111111111011… |
… | …0011111000110101111011 |
3 | 1100012012202220120010101122 |
4 | 2110233332303320311323 |
5 | 2314434130031242334 |
6 | 33423531210535455 |
7 | 2103341513122520 |
oct | 224577663706573 |
9 | 40165686503348 |
10 | 10222002212219 |
11 | 3291143841986 |
12 | 1191113a3758b |
13 | 591c138c2585 |
14 | 274a673a9147 |
15 | 12ad6ecd132e |
hex | 94bfecf8d7b |
10222002212219 has 4 divisors (see below), whose sum is σ = 11682288242544. Its totient is φ = 8761716181896.
The previous prime is 10222002212171. The next prime is 10222002212221. The reversal of 10222002212219 is 91221220022201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10222002212219 - 220 = 10222001163643 is a prime.
It is a super-2 number, since 2×102220022122192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10222002212269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 730143015152 + ... + 730143015165.
It is an arithmetic number, because the mean of its divisors is an integer number (2920572060636).
Almost surely, 210222002212219 is an apocalyptic number.
10222002212219 is a deficient number, since it is larger than the sum of its proper divisors (1460286030325).
10222002212219 is an equidigital number, since it uses as much as digits as its factorization.
10222002212219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1460286030324.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 10222002212219 in words is "ten trillion, two hundred twenty-two billion, two million, two hundred twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •