Base | Representation |
---|---|
bin | 10110110010011110… |
… | …01010100001000100 |
3 | 1011120122111022222222 |
4 | 23121033022201010 |
5 | 200024022100300 |
6 | 5342005111512 |
7 | 612120043520 |
oct | 133117124104 |
9 | 34518438888 |
10 | 12234565700 |
11 | 5209103325 |
12 | 24553b8598 |
13 | 11cc931cb6 |
14 | 840c3ad80 |
15 | 4b9156785 |
hex | 2d93ca844 |
12234565700 has 72 divisors (see below), whose sum is σ = 30363681600. Its totient is φ = 4191672960.
The previous prime is 12234565687. The next prime is 12234565703. The reversal of 12234565700 is 756543221.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is not an unprimeable number, because it can be changed into a prime (12234565703) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1099766 + ... + 1110834.
It is an arithmetic number, because the mean of its divisors is an integer number (421717800).
Almost surely, 212234565700 is an apocalyptic number.
12234565700 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 12234565700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15181840800).
12234565700 is an abundant number, since it is smaller than the sum of its proper divisors (18129115900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12234565700 is a wasteful number, since it uses less digits than its factorization.
12234565700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12669 (or 12662 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 35.
The spelling of 12234565700 in words is "twelve billion, two hundred thirty-four million, five hundred sixty-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •