Base | Representation |
---|---|
bin | 10110110000111000… |
… | …10000010100100100 |
3 | 1011112201101022022200 |
4 | 23120130100110210 |
5 | 200012113021012 |
6 | 5340411054500 |
7 | 611565441252 |
oct | 133034202444 |
9 | 34481338280 |
10 | 12221220132 |
11 | 5201618630 |
12 | 2450a41430 |
13 | 11c9c3b704 |
14 | 83d1655d2 |
15 | 4b7dbc3dc |
hex | 2d8710524 |
12221220132 has 72 divisors (see below), whose sum is σ = 33775184352. Its totient is φ = 3695241600.
The previous prime is 12221220113. The next prime is 12221220149. The reversal of 12221220132 is 23102212221.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 147207 + ... + 214737.
Almost surely, 212221220132 is an apocalyptic number.
12221220132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12221220132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16887592176).
12221220132 is an abundant number, since it is smaller than the sum of its proper divisors (21553964220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12221220132 is a wasteful number, since it uses less digits than its factorization.
12221220132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68009 (or 68004 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 12221220132 its reverse (23102212221), we get a palindrome (35323432353).
The spelling of 12221220132 in words is "twelve billion, two hundred twenty-one million, two hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •