Base | Representation |
---|---|
bin | 1100100000100… |
… | …0111100101111 |
3 | 10122201112002000 |
4 | 3020020330233 |
5 | 101412343310 |
6 | 5112303343 |
7 | 1204643340 |
oct | 310107457 |
9 | 118645060 |
10 | 52465455 |
11 | 27685089 |
12 | 156a1b53 |
13 | ab3c663 |
14 | 6d7a0c7 |
15 | 49154c0 |
hex | 3208f2f |
52465455 has 64 divisors (see below), whose sum is σ = 108518400. Its totient is φ = 23552640.
The previous prime is 52465453. The next prime is 52465463. The reversal of 52465455 is 55456425.
52465455 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 52465455 - 21 = 52465453 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52465453) 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 63 ways as a sum of consecutive naturals, for example, 55285 + ... + 56225.
It is an arithmetic number, because the mean of its divisors is an integer number (1695600).
Almost surely, 252465455 is an apocalyptic number.
52465455 is an abundant number, since it is smaller than the sum of its proper divisors (56052945).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52465455 is a wasteful number, since it uses less digits than its factorization.
52465455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021 (or 1015 counting only the distinct ones).
The product of its digits is 120000, while the sum is 36.
The square root of 52465455 is about 7243.3041493506. The cubic root of 52465455 is about 374.3614733738.
It can be divided in two parts, 5246 and 5455, that added together give a palindrome (10701).
The spelling of 52465455 in words is "fifty-two million, four hundred sixty-five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •