Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0101100100000000100101 |
3 | 1100012000220002221121110221 |
4 | 2110232032011210000211 |
5 | 2314421241410120234 |
6 | 33423015412044341 |
7 | 2103243610216006 |
oct | 224561605440045 |
9 | 40160802847427 |
10 | 10220111020069 |
11 | 3290363262265 |
12 | 11908866036b1 |
13 | 5919a1b53a72 |
14 | 2749281551ad |
15 | 12acadc62eb4 |
hex | 94b8e164025 |
10220111020069 has 2 divisors, whose sum is σ = 10220111020070. Its totient is φ = 10220111020068.
The previous prime is 10220111019997. The next prime is 10220111020073. The reversal of 10220111020069 is 96002011102201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7977020707044 + 2243090313025 = 2824362^2 + 1497695^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220111020069 - 227 = 10219976802341 is a prime.
It is a super-2 number, since 2×102201110200692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220111030069) 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, 5110055510034 + 5110055510035.
It is an arithmetic number, because the mean of its divisors is an integer number (5110055510035).
Almost surely, 210220111020069 is an apocalyptic number.
It is an amenable number.
10220111020069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220111020069 is an equidigital number, since it uses as much as digits as its factorization.
10220111020069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 10220111020069 in words is "ten trillion, two hundred twenty billion, one hundred eleven million, twenty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •