Base | Representation |
---|---|
bin | 10110110011001000… |
… | …10010001001110000 |
3 | 1011121000220121101010 |
4 | 23121210102021300 |
5 | 200031431231000 |
6 | 5342323510520 |
7 | 612215102400 |
oct | 133144221160 |
9 | 34530817333 |
10 | 12240102000 |
11 | 5211244885 |
12 | 2457228440 |
13 | 1200b1cc09 |
14 | 84187c800 |
15 | 4b989bd50 |
hex | 2d9912270 |
12240102000 has 960 divisors, whose sum is σ = 50808176640. Its totient is φ = 2515968000.
The previous prime is 12240101987. The next prime is 12240102011. The reversal of 12240102000 is 20104221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 154937961 + ... + 154938039.
It is an arithmetic number, because the mean of its divisors is an integer number (52925184).
Almost surely, 212240102000 is an apocalyptic number.
12240102000 is a gapful number since it is divisible by the number (10) 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 12240102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25404088320).
12240102000 is an abundant number, since it is smaller than the sum of its proper divisors (38568074640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12240102000 is a wasteful number, since it uses less digits than its factorization.
12240102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167 (or 144 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 12240102000 its reverse (20104221), we get a palindrome (12260206221).
The spelling of 12240102000 in words is "twelve billion, two hundred forty million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •