Base | Representation |
---|---|
bin | 111011000100… |
… | …110000000000 |
3 | 1002010202201210 |
4 | 323010300000 |
5 | 12431022302 |
6 | 1311530120 |
7 | 245425356 |
oct | 73046000 |
9 | 32122653 |
10 | 15485952 |
11 | 8817909 |
12 | 5229940 |
13 | 32928b1 |
14 | 20b17d6 |
15 | 155d66c |
hex | ec4c00 |
15485952 has 66 divisors (see below), whose sum is σ = 41865244. Its totient is φ = 5089280.
The previous prime is 15485941. The next prime is 15485959. The reversal of 15485952 is 25958451.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 15485952.
It is not an unprimeable number, because it can be changed into a prime (15485959) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 218077 + ... + 218147.
Almost surely, 215485952 is an apocalyptic number.
15485952 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 15485952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20932622).
15485952 is an abundant number, since it is smaller than the sum of its proper divisors (26379292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15485952 is an frugal number, since it uses more digits than its factorization.
15485952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165 (or 76 counting only the distinct ones).
The product of its digits is 72000, while the sum is 39.
The square root of 15485952 is about 3935.2194347965. The cubic root of 15485952 is about 249.2561999070.
The spelling of 15485952 in words is "fifteen million, four hundred eighty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •