Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …11011111001101000100101 |
3 | 2121220002212002021012110121 |
4 | 10203113021123321220211 |
5 | 10111021002324213104 |
6 | 110330025402521541 |
7 | 4134362220534301 |
oct | 443271133715045 |
9 | 77802762235417 |
10 | 20022222101029 |
11 | 641a416441495 |
12 | 22b45358062b1 |
13 | b2311a15a845 |
14 | 4d311b6d4d01 |
15 | 24ac55c37254 |
hex | 1235c96f9a25 |
20022222101029 has 2 divisors, whose sum is σ = 20022222101030. Its totient is φ = 20022222101028.
The previous prime is 20022222100963. The next prime is 20022222101053. The reversal of 20022222101029 is 92010122222002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18867747064804 + 1154475036225 = 4343702^2 + 1074465^2 .
It is a cyclic number.
It is not a de Polignac number, because 20022222101029 - 27 = 20022222100901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20022222100994 and 20022222101012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20022222101929) 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, 10011111050514 + 10011111050515.
It is an arithmetic number, because the mean of its divisors is an integer number (10011111050515).
Almost surely, 220022222101029 is an apocalyptic number.
It is an amenable number.
20022222101029 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022222101029 is an equidigital number, since it uses as much as digits as its factorization.
20022222101029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The spelling of 20022222101029 in words is "twenty trillion, twenty-two billion, two hundred twenty-two million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •