Base | Representation |
---|---|
bin | 10011000010100011… |
… | …11000011100111011 |
3 | 222101101112000122011 |
4 | 21201101320130323 |
5 | 131413313342334 |
6 | 4410153110351 |
7 | 511211445616 |
oct | 114121703473 |
9 | 28341460564 |
10 | 10222012219 |
11 | 4376072091 |
12 | 1b933b83b7 |
13 | c6b9b0a53 |
14 | 6cd83517d |
15 | 3ec614564 |
hex | 26147873b |
10222012219 has 2 divisors, whose sum is σ = 10222012220. Its totient is φ = 10222012218.
The previous prime is 10222012183. The next prime is 10222012253. The reversal of 10222012219 is 91221022201.
10222012219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (91221022201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10222012219 - 27 = 10222012091 is a prime.
It is a super-2 number, since 2×102220122192 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10222012219.
It is not a weakly prime, because it can be changed into another prime (10222012259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111006109 + 5111006110.
It is an arithmetic number, because the mean of its divisors is an integer number (5111006110).
Almost surely, 210222012219 is an apocalyptic number.
10222012219 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222012219 is an equidigital number, since it uses as much as digits as its factorization.
10222012219 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 22.
The spelling of 10222012219 in words is "ten billion, two hundred twenty-two million, twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •