Base | Representation |
---|---|
bin | 111000110011… |
… | …110000101000 |
3 | 1001000121002020 |
4 | 320303300220 |
5 | 12303021242 |
6 | 1251104440 |
7 | 240403056 |
oct | 70636050 |
9 | 31017066 |
10 | 14892072 |
11 | 84516a8 |
12 | 4ba2120 |
13 | 31154a0 |
14 | 1d991d6 |
15 | 14926ec |
hex | e33c28 |
14892072 has 64 divisors (see below), whose sum is σ = 40824000. Its totient is φ = 4498944.
The previous prime is 14892071. The next prime is 14892077. The reversal of 14892072 is 27029841.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (14892071) 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 15 ways as a sum of consecutive naturals, for example, 18004 + ... + 18812.
It is an arithmetic number, because the mean of its divisors is an integer number (637875).
Almost surely, 214892072 is an apocalyptic number.
14892072 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 14892072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20412000).
14892072 is an abundant number, since it is smaller than the sum of its proper divisors (25931928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14892072 is a wasteful number, since it uses less digits than its factorization.
14892072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890 (or 886 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 33.
The square root of 14892072 is about 3859.0247472645. The cubic root of 14892072 is about 246.0282867863.
The spelling of 14892072 in words is "fourteen million, eight hundred ninety-two thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •