Base | Representation |
---|---|
bin | 11100111010110… |
… | …001000000010101 |
3 | 1020210221001011210 |
4 | 130322301000111 |
5 | 1443200322000 |
6 | 120050452033 |
7 | 15010565262 |
oct | 3472610025 |
9 | 1223831153 |
10 | 485167125 |
11 | 229956273 |
12 | 116594019 |
13 | 79690851 |
14 | 48614269 |
15 | 2c8d8350 |
hex | 1ceb1015 |
485167125 has 64 divisors (see below), whose sum is σ = 842250240. Its totient is φ = 247795200.
The previous prime is 485167091. The next prime is 485167127. The reversal of 485167125 is 521761584.
It is not a de Polignac number, because 485167125 - 29 = 485166613 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485167127) 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, 1012636 + ... + 1013114.
It is an arithmetic number, because the mean of its divisors is an integer number (13160160).
Almost surely, 2485167125 is an apocalyptic number.
It is an amenable number.
485167125 is a deficient number, since it is larger than the sum of its proper divisors (357083115).
485167125 is a wasteful number, since it uses less digits than its factorization.
485167125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607 (or 597 counting only the distinct ones).
The product of its digits is 67200, while the sum is 39.
The square root of 485167125 is about 22026.5095963932. The cubic root of 485167125 is about 785.7730359454.
The spelling of 485167125 in words is "four hundred eighty-five million, one hundred sixty-seven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •