Base | Representation |
---|---|
bin | 101100010000100… |
… | …0101010010100001 |
3 | 10211111102020112020 |
4 | 1120201011102201 |
5 | 11020134124200 |
6 | 403210052053 |
7 | 51541602432 |
oct | 13041052241 |
9 | 3744366466 |
10 | 1485067425 |
11 | 6a2311156 |
12 | 35541a029 |
13 | 1a889452a |
14 | 101337489 |
15 | 8a599ea0 |
hex | 588454a1 |
1485067425 has 12 divisors (see below), whose sum is σ = 2455311600. Its totient is φ = 792035920.
The previous prime is 1485067343. The next prime is 1485067429. The reversal of 1485067425 is 5247605841.
It is a happy number.
It is not a de Polignac number, because 1485067425 - 212 = 1485063329 is a prime.
It is a super-2 number, since 2×14850674252 = 4410850513592261250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1485067429) 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 11 ways as a sum of consecutive naturals, for example, 9900375 + ... + 9900524.
It is an arithmetic number, because the mean of its divisors is an integer number (204609300).
Almost surely, 21485067425 is an apocalyptic number.
1485067425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1485067425 is a deficient number, since it is larger than the sum of its proper divisors (970244175).
1485067425 is a wasteful number, since it uses less digits than its factorization.
1485067425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19800912 (or 19800907 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 42.
The square root of 1485067425 is about 38536.5725642538. The cubic root of 1485067425 is about 1140.9030049078.
The spelling of 1485067425 in words is "one billion, four hundred eighty-five million, sixty-seven thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •