Base | Representation |
---|---|
bin | 10010101111010111… |
… | …110011011100110001 |
3 | 1220221100022201012000 |
4 | 102233113303130301 |
5 | 312202230401113 |
6 | 13124410524213 |
7 | 1311434133546 |
oct | 225727633461 |
9 | 56840281160 |
10 | 20122122033 |
11 | 8596460122 |
12 | 3a96a36669 |
13 | 1b88a956b0 |
14 | d8c5d4bcd |
15 | 7cb840373 |
hex | 4af5f3731 |
20122122033 has 128 divisors (see below), whose sum is σ = 35247744000. Its totient is φ = 11240570880.
The previous prime is 20122122023. The next prime is 20122122037. The reversal of 20122122033 is 33022122102.
It is not a de Polignac number, because 20122122033 - 25 = 20122122001 is a prime.
It is a super-2 number, since 2×201221220332 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20122121997 and 20122122015.
It is not an unprimeable number, because it can be changed into a prime (20122122037) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 14280433 + ... + 14281841.
It is an arithmetic number, because the mean of its divisors is an integer number (275373000).
Almost surely, 220122122033 is an apocalyptic number.
20122122033 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20122122033 is a deficient number, since it is larger than the sum of its proper divisors (15125621967).
20122122033 is a wasteful number, since it uses less digits than its factorization.
20122122033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544 (or 1538 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20122122033 its reverse (33022122102), we get a palindrome (53144244135).
The spelling of 20122122033 in words is "twenty billion, one hundred twenty-two million, one hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •