Base | Representation |
---|---|
bin | 10110110011011000… |
… | …10101100100000000 |
3 | 1011121011212212021202 |
4 | 23121230111210000 |
5 | 200033001304440 |
6 | 5342441040332 |
7 | 612242044304 |
oct | 133154254400 |
9 | 34534785252 |
10 | 12242213120 |
11 | 5212456a05 |
12 | 2457a860a8 |
13 | 12013abab7 |
14 | 841c6bd04 |
15 | 4b9b67615 |
hex | 2d9b15900 |
12242213120 has 72 divisors (see below), whose sum is σ = 30335187960. Its totient is φ = 4728012800.
The previous prime is 12242213119. The next prime is 12242213153. The reversal of 12242213120 is 2131224221.
It can be written as a sum of positive squares in 4 ways, for example, as 1104365824 + 11137847296 = 33232^2 + 105536^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 12242213092 and 12242213101.
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, 127781 + ... + 202020.
It is an arithmetic number, because the mean of its divisors is an integer number (421322055).
Almost surely, 212242213120 is an apocalyptic number.
12242213120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12242213120 is an abundant number, since it is smaller than the sum of its proper divisors (18092974840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12242213120 is an equidigital number, since it uses as much as digits as its factorization.
12242213120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329851 (or 329837 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 12242213120 its reverse (2131224221), we get a palindrome (14373437341).
The spelling of 12242213120 in words is "twelve billion, two hundred forty-two million, two hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •