Base | Representation |
---|---|
bin | 10110110100011110… |
… | …01010011001000000 |
3 | 1011121211001200022020 |
4 | 23122033022121000 |
5 | 200042320424100 |
6 | 5343404441440 |
7 | 612412456263 |
oct | 133217123100 |
9 | 34554050266 |
10 | 12251342400 |
11 | 5217621970 |
12 | 245ab49280 |
13 | 120325723b |
14 | 843166cda |
15 | 4ba86c5a0 |
hex | 2da3ca640 |
12251342400 has 336 divisors, whose sum is σ = 46431403200. Its totient is φ = 2795110400.
The previous prime is 12251342309. The next prime is 12251342423. The reversal of 12251342400 is 424315221.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 890776 + ... + 904424.
It is an arithmetic number, because the mean of its divisors is an integer number (138188700).
Almost surely, 212251342400 is an apocalyptic number.
12251342400 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 12251342400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23215701600).
12251342400 is an abundant number, since it is smaller than the sum of its proper divisors (34180060800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12251342400 is a wasteful number, since it uses less digits than its factorization.
12251342400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13702 (or 13687 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 12251342400 its reverse (424315221), we get a palindrome (12675657621).
The spelling of 12251342400 in words is "twelve billion, two hundred fifty-one million, three hundred forty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •