Base | Representation |
---|---|
bin | 111000010110101111… |
… | …0010011001101100100 |
3 | 102120101020020200201010 |
4 | 1300231132103031210 |
5 | 3440323113031040 |
6 | 131332521302220 |
7 | 11513016021063 |
oct | 1605536231544 |
9 | 376336220633 |
10 | 121022002020 |
11 | 47363846397 |
12 | 1b556034970 |
13 | b548b58caa |
14 | 5c00d801da |
15 | 3234a80e80 |
hex | 1c2d793364 |
121022002020 has 24 divisors (see below), whose sum is σ = 338861605824. Its totient is φ = 32272533856.
The previous prime is 121022001973. The next prime is 121022002039. The reversal of 121022002020 is 20200220121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 121022001987 and 121022002005.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 1008516624 + ... + 1008516743.
It is an arithmetic number, because the mean of its divisors is an integer number (14119233576).
Almost surely, 2121022002020 is an apocalyptic number.
121022002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121022002020 is an abundant number, since it is smaller than the sum of its proper divisors (217839603804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121022002020 is a wasteful number, since it uses less digits than its factorization.
121022002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2017033379 (or 2017033377 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 121022002020 its reverse (20200220121), we get a palindrome (141222222141).
The spelling of 121022002020 in words is "one hundred twenty-one billion, twenty-two million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •