Base | Representation |
---|---|
bin | 10110110000111000… |
… | …01110010111011000 |
3 | 1011112201100220022221 |
4 | 23120130032113120 |
5 | 200012112241440 |
6 | 5340410553424 |
7 | 611565406015 |
oct | 133034162730 |
9 | 34481326287 |
10 | 12221212120 |
11 | 5201612607 |
12 | 2450a38874 |
13 | 11c9c37b80 |
14 | 83d16270c |
15 | 4b7db9d4a |
hex | 2d870e5d8 |
12221212120 has 32 divisors (see below), whose sum is σ = 29612938320. Its totient is φ = 4512447360.
The previous prime is 12221212109. The next prime is 12221212169. The reversal of 12221212120 is 2121212221.
It is a happy number.
12221212120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12221212094 and 12221212103.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 11750646 + ... + 11751685.
Almost surely, 212221212120 is an apocalyptic number.
12221212120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12221212120 is an abundant number, since it is smaller than the sum of its proper divisors (17391726200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12221212120 is a wasteful number, since it uses less digits than its factorization.
12221212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23502355 (or 23502351 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12221212120 its reverse (2121212221), we get a palindrome (14342424341).
The spelling of 12221212120 in words is "twelve billion, two hundred twenty-one million, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •