Base | Representation |
---|---|
bin | 11010100011000001… |
… | …00111000100000000 |
3 | 1100210021102012010120 |
4 | 31101200213010000 |
5 | 213142103424432 |
6 | 10314130300240 |
7 | 1013121305100 |
oct | 152140470400 |
9 | 40707365116 |
10 | 14252404992 |
11 | 6054124901 |
12 | 2919127680 |
13 | 14619b4147 |
14 | 992c1b200 |
15 | 58638ec2c |
hex | 351827100 |
14252404992 has 216 divisors, whose sum is σ = 44565708096. Its totient is φ = 4031483904.
The previous prime is 14252404979. The next prime is 14252404993. The reversal of 14252404992 is 29940425241.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (14252404993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3874258 + ... + 3877934.
Almost surely, 214252404992 is an apocalyptic number.
14252404992 is a gapful number since it is divisible by the number (12) 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 14252404992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22282854048).
14252404992 is an abundant number, since it is smaller than the sum of its proper divisors (30313303104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14252404992 is a wasteful number, since it uses less digits than its factorization.
14252404992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3813 (or 3792 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 14252404992 in words is "fourteen billion, two hundred fifty-two million, four hundred four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •