Base | Representation |
---|---|
bin | 11010100011011001… |
… | …00111001011100000 |
3 | 1100210111100000220210 |
4 | 31101230213023200 |
5 | 213143410114300 |
6 | 10314321534120 |
7 | 1013160120522 |
oct | 152154471340 |
9 | 40714300823 |
10 | 14255551200 |
11 | 6055983680 |
12 | 291a1a4340 |
13 | 14625461c7 |
14 | 9933d9a12 |
15 | 5867b2050 |
hex | 351b272e0 |
14255551200 has 288 divisors, whose sum is σ = 51701690880. Its totient is φ = 3382067200.
The previous prime is 14255551151. The next prime is 14255551213. The reversal of 14255551200 is 215555241.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 1235056 + ... + 1246544.
It is an arithmetic number, because the mean of its divisors is an integer number (179519760).
Almost surely, 214255551200 is an apocalyptic number.
14255551200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14255551200 is the 68934-th octagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14255551200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25850845440).
14255551200 is an abundant number, since it is smaller than the sum of its proper divisors (37446139680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14255551200 is a wasteful number, since it uses less digits than its factorization.
14255551200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11570 (or 11557 counting only the distinct ones).
The product of its (nonzero) digits is 10000, while the sum is 30.
The spelling of 14255551200 in words is "fourteen billion, two hundred fifty-five million, five hundred fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •