Base | Representation |
---|---|
bin | 1100100111100… |
… | …0100001110101 |
3 | 10200120202000001 |
4 | 3021320201311 |
5 | 102022004420 |
6 | 5130151301 |
7 | 1211555650 |
oct | 311704165 |
9 | 120522001 |
10 | 52922485 |
11 | 279674a0 |
12 | 15882531 |
13 | ac6c6a5 |
14 | 7058897 |
15 | 49a5b0a |
hex | 3278875 |
52922485 has 32 divisors (see below), whose sum is σ = 80020224. Its totient is φ = 32640000.
The previous prime is 52922483. The next prime is 52922537. The reversal of 52922485 is 58422925.
52922485 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 52922485 - 21 = 52922483 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52922483) 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, 38205 + ... + 39565.
It is an arithmetic number, because the mean of its divisors is an integer number (2500632).
Almost surely, 252922485 is an apocalyptic number.
52922485 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52922485 is a deficient number, since it is larger than the sum of its proper divisors (27097739).
52922485 is a wasteful number, since it uses less digits than its factorization.
52922485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1485.
The product of its digits is 57600, while the sum is 37.
The square root of 52922485 is about 7274.7841892389. The cubic root of 52922485 is about 375.4453612366.
It can be divided in two parts, 5292 and 2485, that added together give a palindrome (7777).
The spelling of 52922485 in words is "fifty-two million, nine hundred twenty-two thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •