Base | Representation |
---|---|
bin | 1100011111000… |
… | …0000011001001 |
3 | 10122112100011121 |
4 | 3013300003021 |
5 | 101401112330 |
6 | 5110155241 |
7 | 1204040110 |
oct | 307600311 |
9 | 118470147 |
10 | 52363465 |
11 | 276154a0 |
12 | 15652b21 |
13 | ab050cb |
14 | 6d50c77 |
15 | 48e517a |
hex | 31f00c9 |
52363465 has 32 divisors (see below), whose sum is σ = 80188416. Its totient is φ = 31872960.
The previous prime is 52363457. The next prime is 52363469. The reversal of 52363465 is 56436325.
It is not a de Polignac number, because 52363465 - 23 = 52363457 is a prime.
It is a Smith number, since the sum of its digits (34) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 52363465.
It is not an unprimeable number, because it can be changed into a prime (52363469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14974 + ... + 18136.
It is an arithmetic number, because the mean of its divisors is an integer number (2505888).
Almost surely, 252363465 is an apocalyptic number.
52363465 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52363465 is a deficient number, since it is larger than the sum of its proper divisors (27824951).
52363465 is a wasteful number, since it uses less digits than its factorization.
52363465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3229.
The product of its digits is 64800, while the sum is 34.
The square root of 52363465 is about 7236.2604292549. The cubic root of 52363465 is about 374.1187365475.
The spelling of 52363465 in words is "fifty-two million, three hundred sixty-three thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •