Base | Representation |
---|---|
bin | 11010100010100011… |
… | …01111010110110000 |
3 | 1100210000002010211002 |
4 | 31101101233112300 |
5 | 213140104204200 |
6 | 10313510541132 |
7 | 1013043211103 |
oct | 152121572660 |
9 | 40700063732 |
10 | 14248506800 |
11 | 6051a02060 |
12 | 29179677a8 |
13 | 1460c4aa18 |
14 | 9924c473a |
15 | 585d6ebd5 |
hex | 35146f5b0 |
14248506800 has 120 divisors (see below), whose sum is σ = 37569595392. Its totient is φ = 5149984000.
The previous prime is 14248506787. The next prime is 14248506817. The reversal of 14248506800 is 860584241.
It is a happy number.
14248506800 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 725105 + ... + 744495.
Almost surely, 214248506800 is an apocalyptic number.
14248506800 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 14248506800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18784797696).
14248506800 is an abundant number, since it is smaller than the sum of its proper divisors (23321088592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14248506800 is a wasteful number, since it uses less digits than its factorization.
14248506800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19587 (or 19576 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 38.
The spelling of 14248506800 in words is "fourteen billion, two hundred forty-eight million, five hundred six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •