Base | Representation |
---|---|
bin | 10110110011000111… |
… | …11110010011011100 |
3 | 1011121000202110212000 |
4 | 23121203332103130 |
5 | 200031421130300 |
6 | 5342322042300 |
7 | 612214313355 |
oct | 133143762334 |
9 | 34530673760 |
10 | 12240020700 |
11 | 5211199796 |
12 | 24571a9390 |
13 | 1200ac1bcb |
14 | 84185ad2c |
15 | 4b9882c00 |
hex | 2d98fe4dc |
12240020700 has 144 divisors (see below), whose sum is σ = 39388833120. Its totient is φ = 3260736000.
The previous prime is 12240020677. The next prime is 12240020701. The reversal of 12240020700 is 702004221.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12240020701) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3997170 + ... + 4000230.
Almost surely, 212240020700 is an apocalyptic number.
12240020700 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 12240020700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19694416560).
12240020700 is an abundant number, since it is smaller than the sum of its proper divisors (27148812420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12240020700 is a wasteful number, since it uses less digits than its factorization.
12240020700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4565 (or 4552 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 18.
Adding to 12240020700 its reverse (702004221), we get a palindrome (12942024921).
The spelling of 12240020700 in words is "twelve billion, two hundred forty million, twenty thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •