Base | Representation |
---|---|
bin | 10110111101011110… |
… | …01011010110011000 |
3 | 1011211002010112202101 |
4 | 23132233023112120 |
5 | 200221133000200 |
6 | 5355103013144 |
7 | 614320305055 |
oct | 133657132630 |
9 | 34732115671 |
10 | 12326843800 |
11 | 5256200217 |
12 | 248029a1b4 |
13 | 1215aa0b1b |
14 | 84d1bc02c |
15 | 4c22d326a |
hex | 2debcb598 |
12326843800 has 48 divisors (see below), whose sum is σ = 28722837960. Its totient is φ = 4919911680.
The previous prime is 12326843779. The next prime is 12326843821. The reversal of 12326843800 is 834862321.
It is an interprime number because it is at equal distance from previous prime (12326843779) and next prime (12326843821).
It is a self number, because there is not a number n which added to its sum of digits gives 12326843800.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23967 + ... + 158833.
Almost surely, 212326843800 is an apocalyptic number.
12326843800 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 12326843800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14361418980).
12326843800 is an abundant number, since it is smaller than the sum of its proper divisors (16395994160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12326843800 is a wasteful number, since it uses less digits than its factorization.
12326843800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135340 (or 135331 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 37.
The spelling of 12326843800 in words is "twelve billion, three hundred twenty-six million, eight hundred forty-three thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •