Base | Representation |
---|---|
bin | 1100100000101… |
… | …1100000111111 |
3 | 10122202001111100 |
4 | 3020023200333 |
5 | 101413212332 |
6 | 5112424143 |
7 | 1205016105 |
oct | 310134077 |
9 | 118661440 |
10 | 52475967 |
11 | 27691a75 |
12 | 156a8053 |
13 | ab4438b |
14 | 6d7dc75 |
15 | 491867c |
hex | 320b83f |
52475967 has 12 divisors (see below), whose sum is σ = 79788280. Its totient is φ = 33142608.
The previous prime is 52475959. The next prime is 52475981. The reversal of 52475967 is 76957425.
52475967 is a `hidden beast` number, since 52 + 4 + 7 + 596 + 7 = 666.
52475967 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 52475967 - 23 = 52475959 is a prime.
It is a super-2 number, since 2×524759672 = 5507454225170178, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52475947) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 153268 + ... + 153609.
Almost surely, 252475967 is an apocalyptic number.
52475967 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
52475967 is a deficient number, since it is larger than the sum of its proper divisors (27312313).
52475967 is a wasteful number, since it uses less digits than its factorization.
52475967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306902 (or 306899 counting only the distinct ones).
The product of its digits is 529200, while the sum is 45.
The square root of 52475967 is about 7244.0297486965. The cubic root of 52475967 is about 374.3864741100.
The spelling of 52475967 in words is "fifty-two million, four hundred seventy-five thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •