Base | Representation |
---|---|
bin | 1100110101011101001111… |
… | …1111100001111110111000 |
3 | 1211222010220002002022001102 |
4 | 3031113103333201332320 |
5 | 3322204422144323300 |
6 | 50003112031310532 |
7 | 2654411335400066 |
oct | 315272377417670 |
9 | 54863802068042 |
10 | 14112524214200 |
11 | 45510a7008235 |
12 | 16bb12797b448 |
13 | 7b4a613aa909 |
14 | 36b09a9a7036 |
15 | 1971749060d5 |
hex | cd5d3fe1fb8 |
14112524214200 has 96 divisors (see below), whose sum is σ = 33275923664400. Its totient is φ = 5565494922240.
The previous prime is 14112524214169. The next prime is 14112524214223. The reversal of 14112524214200 is 241242521141.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5034182 + ... + 7319018.
Almost surely, 214112524214200 is an apocalyptic number.
14112524214200 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 14112524214200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16637961832200).
14112524214200 is an abundant number, since it is smaller than the sum of its proper divisors (19163399450200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14112524214200 is a wasteful number, since it uses less digits than its factorization.
14112524214200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2285289 (or 2285280 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 29.
Adding to 14112524214200 its reverse (241242521141), we get a palindrome (14353766735341).
The spelling of 14112524214200 in words is "fourteen trillion, one hundred twelve billion, five hundred twenty-four million, two hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •