Base | Representation |
---|---|
bin | 10011000010100101… |
… | …01001011111001101 |
3 | 222101101220020011001 |
4 | 21201102221133031 |
5 | 131413341304234 |
6 | 4410201300301 |
7 | 511213243315 |
oct | 114122513715 |
9 | 28341806131 |
10 | 10222213069 |
11 | 4376199a82 |
12 | 1b93494691 |
13 | c6ba512b3 |
14 | 6cd888445 |
15 | 3ec653d14 |
hex | 2614a97cd |
10222213069 has 2 divisors, whose sum is σ = 10222213070. Its totient is φ = 10222213068.
The previous prime is 10222213051. The next prime is 10222213121. The reversal of 10222213069 is 96031222201.
10222213069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10173143044 + 49070025 = 100862^2 + 7005^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222213069 - 25 = 10222213037 is a prime.
It is a super-2 number, since 2×102222130692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222213669) 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, 5111106534 + 5111106535.
It is an arithmetic number, because the mean of its divisors is an integer number (5111106535).
Almost surely, 210222213069 is an apocalyptic number.
It is an amenable number.
10222213069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222213069 is an equidigital number, since it uses as much as digits as its factorization.
10222213069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 10222213069 in words is "ten billion, two hundred twenty-two million, two hundred thirteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •