Base | Representation |
---|---|
bin | 111000111000… |
… | …001000000000 |
3 | 1001001111121110 |
4 | 320320020000 |
5 | 12304104302 |
6 | 1251323320 |
7 | 240506151 |
oct | 70701000 |
9 | 31044543 |
10 | 14909952 |
11 | 8464082 |
12 | 4bb0540 |
13 | 3120675 |
14 | 1da1928 |
15 | 1497b6c |
hex | e38200 |
14909952 has 80 divisors (see below), whose sum is σ = 42131232. Its totient is φ = 4669440.
The previous prime is 14909941. The next prime is 14909959. The reversal of 14909952 is 25990941.
It is a self number, because there is not a number n which added to its sum of digits gives 14909952.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14909959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25827 + ... + 26397.
Almost surely, 214909952 is an apocalyptic number.
14909952 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 14909952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21065616).
14909952 is an abundant number, since it is smaller than the sum of its proper divisors (27221280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14909952 is an equidigital number, since it uses as much as digits as its factorization.
14909952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609 (or 593 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 39.
The square root of 14909952 is about 3861.3406998088. The cubic root of 14909952 is about 246.1267111114.
The spelling of 14909952 in words is "fourteen million, nine hundred nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •