Base | Representation |
---|---|
bin | 10010101001011010… |
… | …101000011100111001 |
3 | 1220200101022011002110 |
4 | 102221122220130321 |
5 | 312001140400441 |
6 | 13110441122533 |
7 | 1306111615200 |
oct | 225132503471 |
9 | 56611264073 |
10 | 20022200121 |
11 | 8545012330 |
12 | 3a69489449 |
13 | 1b7117b5c1 |
14 | d7d224237 |
15 | 7c2ba3b16 |
hex | 4a96a8739 |
20022200121 has 24 divisors (see below), whose sum is σ = 33878011104. Its totient is φ = 10401142080.
The previous prime is 20022200119. The next prime is 20022200137. The reversal of 20022200121 is 12100222002.
It is not a de Polignac number, because 20022200121 - 21 = 20022200119 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20022200097 and 20022200106.
It is not an unprimeable number, because it can be changed into a prime (20022200101) 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 in 23 ways as a sum of consecutive naturals, for example, 6189540 + ... + 6192773.
It is an arithmetic number, because the mean of its divisors is an integer number (1411583796).
Almost surely, 220022200121 is an apocalyptic number.
20022200121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20022200121 is a deficient number, since it is larger than the sum of its proper divisors (13855810983).
20022200121 is a wasteful number, since it uses less digits than its factorization.
20022200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12382341 (or 12382334 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20022200121 its reverse (12100222002), we get a palindrome (32122422123).
The spelling of 20022200121 in words is "twenty billion, twenty-two million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •