Base | Representation |
---|---|
bin | 111000101110… |
… | …001010100000 |
3 | 1000222102122100 |
4 | 320232022200 |
5 | 12301303102 |
6 | 1250410400 |
7 | 240246204 |
oct | 70561240 |
9 | 30872570 |
10 | 14869152 |
11 | 8436461 |
12 | 4b90a00 |
13 | 3107c1c |
14 | 1d90b04 |
15 | 148aa1c |
hex | e2e2a0 |
14869152 has 72 divisors (see below), whose sum is σ = 44786196. Its totient is φ = 4663296.
The previous prime is 14869139. The next prime is 14869163. The reversal of 14869152 is 25196841.
It can be written as a sum of positive squares in 2 ways, for example, as 13220496 + 1648656 = 3636^2 + 1284^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3378 + ... + 6414.
Almost surely, 214869152 is an apocalyptic number.
14869152 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 14869152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22393098).
14869152 is an abundant number, since it is smaller than the sum of its proper divisors (29917044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14869152 is a wasteful number, since it uses less digits than its factorization.
14869152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3070 (or 3059 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
The square root of 14869152 is about 3856.0539415314. The cubic root of 14869152 is about 245.9020034023.
The spelling of 14869152 in words is "fourteen million, eight hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •