Base | Representation |
---|---|
bin | 1101000101110… |
… | …1000101110100 |
3 | 10211022120120221 |
4 | 3101131011310 |
5 | 103024013002 |
6 | 5240504124 |
7 | 1234463311 |
oct | 321350564 |
9 | 124276527 |
10 | 54907252 |
11 | 28aa26a4 |
12 | 1647b044 |
13 | b4b5bca |
14 | 7413d08 |
15 | 4c48c37 |
hex | 345d174 |
54907252 has 12 divisors (see below), whose sum is σ = 96181540. Its totient is φ = 27426816.
The previous prime is 54907243. The next prime is 54907261. The reversal of 54907252 is 25270945.
54907252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (54907243) and next prime (54907261).
It can be written as a sum of positive squares in 2 ways, for example, as 20848356 + 34058896 = 4566^2 + 5836^2 .
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1677 + ... + 10612.
Almost surely, 254907252 is an apocalyptic number.
It is an amenable number.
54907252 is a deficient number, since it is larger than the sum of its proper divisors (41274288).
54907252 is a wasteful number, since it uses less digits than its factorization.
54907252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13410 (or 13408 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 54907252 is about 7409.9427798061. The cubic root of 54907252 is about 380.0813583878.
The spelling of 54907252 in words is "fifty-four million, nine hundred seven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •