Base | Representation |
---|---|
bin | 1100100000101… |
… | …0001110111011 |
3 | 10122201210021211 |
4 | 3020022032323 |
5 | 101413030330 |
6 | 5112343551 |
7 | 1204664563 |
oct | 310121673 |
9 | 118653254 |
10 | 52470715 |
11 | 27689030 |
12 | 156a4bb7 |
13 | ab41b7b |
14 | 6d7bda3 |
15 | 4916d2a |
hex | 320a3bb |
52470715 has 32 divisors (see below), whose sum is σ = 72264960. Its totient is φ = 36220800.
The previous prime is 52470713. The next prime is 52470731. The reversal of 52470715 is 51707425.
52470715 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 52470715 - 21 = 52470713 is a prime.
It is a super-3 number, since 3×524707153 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (52470713) 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 31 ways as a sum of consecutive naturals, for example, 106620 + ... + 107110.
It is an arithmetic number, because the mean of its divisors is an integer number (2258280).
Almost surely, 252470715 is an apocalyptic number.
52470715 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
52470715 is a deficient number, since it is larger than the sum of its proper divisors (19794245).
52470715 is a wasteful number, since it uses less digits than its factorization.
52470715 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603.
The product of its (nonzero) digits is 9800, while the sum is 31.
The square root of 52470715 is about 7243.6672342122. The cubic root of 52470715 is about 374.3739836725.
The spelling of 52470715 in words is "fifty-two million, four hundred seventy thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •