Base | Representation |
---|---|
bin | 111000110100011110… |
… | …1010111010100000101 |
3 | 102122221210011021222101 |
4 | 1301220331113110011 |
5 | 3444344110013104 |
6 | 132015532032101 |
7 | 11546524616143 |
oct | 1615075272405 |
9 | 378853137871 |
10 | 122020001029 |
11 | 47826122863 |
12 | 1b794302631 |
13 | b677845454 |
14 | 5c9772a593 |
15 | 32924b95a4 |
hex | 1c68f57505 |
122020001029 has 2 divisors, whose sum is σ = 122020001030. Its totient is φ = 122020001028.
The previous prime is 122020001017. The next prime is 122020001039. The reversal of 122020001029 is 920100020221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114507792100 + 7512208929 = 338390^2 + 86673^2 .
It is a cyclic number.
It is not a de Polignac number, because 122020001029 - 27 = 122020000901 is a prime.
It is a super-2 number, since 2×1220200010292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122020000997 and 122020001015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122020001009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61010000514 + 61010000515.
It is an arithmetic number, because the mean of its divisors is an integer number (61010000515).
Almost surely, 2122020001029 is an apocalyptic number.
It is an amenable number.
122020001029 is a deficient number, since it is larger than the sum of its proper divisors (1).
122020001029 is an equidigital number, since it uses as much as digits as its factorization.
122020001029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The spelling of 122020001029 in words is "one hundred twenty-two billion, twenty million, one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •