Base | Representation |
---|---|
bin | 10010001100100… |
… | …11000110001001 |
3 | 101122020012222111 |
4 | 21012103012021 |
5 | 303034133100 |
6 | 23051422321 |
7 | 3532320100 |
oct | 1106230611 |
9 | 348205874 |
10 | 152646025 |
11 | 7918a244 |
12 | 431549a1 |
13 | 258173bc |
14 | 163b7037 |
15 | d6036ba |
hex | 9193189 |
152646025 has 27 divisors (see below), whose sum is σ = 220809621. Its totient is φ = 104375040.
The previous prime is 152646023. The next prime is 152646029. The reversal of 152646025 is 520646251.
The square root of 152646025 is 12355.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 8357881 + 144288144 = 2891^2 + 12012^2 .
It is not a de Polignac number, because 152646025 - 21 = 152646023 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152646023) 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 26 ways as a sum of consecutive naturals, for example, 432249 + ... + 432601.
Almost surely, 2152646025 is an apocalyptic number.
152646025 is the 12355-th square number.
152646025 is the 6178-th centered octagonal number.
It is an amenable number.
152646025 is a deficient number, since it is larger than the sum of its proper divisors (68163596).
152646025 is an frugal number, since it uses more digits than its factorization.
152646025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730 (or 365 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
The cubic root of 152646025 is about 534.4353375094.
Multiplying 152646025 by its product of nonzero digits (14400), we get a square (2198102760000 = 14826002).
The spelling of 152646025 in words is "one hundred fifty-two million, six hundred forty-six thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •