Base | Representation |
---|---|
bin | 1011000111011011001111… |
… | …1001011000001100111000 |
3 | 1121021102122010210201221222 |
4 | 2301312303321120030320 |
5 | 3100222031212320440 |
6 | 41554445021451212 |
7 | 2401011340612544 |
oct | 261666371301470 |
9 | 47242563721858 |
10 | 12222200120120 |
11 | 3992451376911 |
12 | 14548b2110b08 |
13 | 6a871915a8c3 |
14 | 3037b4254a24 |
15 | 162dda3532b5 |
hex | b1db3e58338 |
12222200120120 has 32 divisors (see below), whose sum is σ = 27614057969520. Its totient is φ = 4868594234880.
The previous prime is 12222200120099. The next prime is 12222200120159. The reversal of 12222200120120 is 2102100222221.
It is a happy number.
It is a super-2 number, since 2×122222001201202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 633921902 + ... + 633941181.
Almost surely, 212222200120120 is an apocalyptic number.
12222200120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12222200120120 is an abundant number, since it is smaller than the sum of its proper divisors (15391857849400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12222200120120 is a wasteful number, since it uses less digits than its factorization.
12222200120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1267863335 (or 1267863331 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 12222200120120 its reverse (2102100222221), we get a palindrome (14324300342341).
The spelling of 12222200120120 in words is "twelve trillion, two hundred twenty-two billion, two hundred million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •