Base | Representation |
---|---|
bin | 111000110111011111… |
… | …1110010100010011000 |
3 | 102200012211202211012120 |
4 | 1301232333302202120 |
5 | 4000101023100440 |
6 | 132033551141240 |
7 | 11552164631601 |
oct | 1615677624230 |
9 | 380184684176 |
10 | 122121300120 |
11 | 47878321316 |
12 | 1b802214820 |
13 | b692822341 |
14 | 5ca6d78da8 |
15 | 329b328dd0 |
hex | 1c6eff2898 |
122121300120 has 32 divisors (see below), whose sum is σ = 366363900720. Its totient is φ = 32565680000.
The previous prime is 122121300097. The next prime is 122121300139. The reversal of 122121300120 is 21003121221.
It is a super-2 number, since 2×1221213001202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 122121300120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 508838631 + ... + 508838870.
Almost surely, 2122121300120 is an apocalyptic number.
122121300120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122121300120 is an abundant number, since it is smaller than the sum of its proper divisors (244242600600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122121300120 is a wasteful number, since it uses less digits than its factorization.
122121300120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017677515 (or 1017677511 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 122121300120 its reverse (21003121221), we get a palindrome (143124421341).
The spelling of 122121300120 in words is "one hundred twenty-two billion, one hundred twenty-one million, three hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •