Base | Representation |
---|---|
bin | 11010100010100100… |
… | …10010100111000000 |
3 | 1100210000100110220020 |
4 | 31101102102213000 |
5 | 213140123314300 |
6 | 10313514013440 |
7 | 1013044352100 |
oct | 152122224700 |
9 | 40700313806 |
10 | 14248651200 |
11 | 6051aa05a3 |
12 | 2917a17280 |
13 | 1460c9b674 |
14 | 992521200 |
15 | 585d9c8a0 |
hex | 3514929c0 |
14248651200 has 504 divisors, whose sum is σ = 56281777200. Its totient is φ = 3143024640.
The previous prime is 14248651187. The next prime is 14248651211. The reversal of 14248651200 is 215684241.
It is a happy number.
It is a super-2 number, since 2×142486512002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 6819756 + ... + 6821844.
Almost surely, 214248651200 is an apocalyptic number.
14248651200 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 14248651200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28140888600).
14248651200 is an abundant number, since it is smaller than the sum of its proper divisors (42033126000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14248651200 is a wasteful number, since it uses less digits than its factorization.
14248651200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2157 (or 2135 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 33.
The spelling of 14248651200 in words is "fourteen billion, two hundred forty-eight million, six hundred fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •