Base | Representation |
---|---|
bin | 10010001001101… |
… | …01100101110001 |
3 | 101121111202121022 |
4 | 21010311211301 |
5 | 302434404100 |
6 | 23035305225 |
7 | 3526133345 |
oct | 1104654561 |
9 | 347452538 |
10 | 152263025 |
11 | 78a48512 |
12 | 42bab215 |
13 | 25711c85 |
14 | 16317625 |
15 | d579e85 |
hex | 9135971 |
152263025 has 12 divisors (see below), whose sum is σ = 189411612. Its totient is φ = 121419840.
The previous prime is 152263019. The next prime is 152263031. The reversal of 152263025 is 520362251.
It is an interprime number because it is at equal distance from previous prime (152263019) and next prime (152263031).
It can be written as a sum of positive squares in 6 ways, for example, as 2053489 + 150209536 = 1433^2 + 12256^2 .
It is not a de Polignac number, because 152263025 - 26 = 152262961 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152262985 and 152263003.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1682 + ... + 17531.
It is an arithmetic number, because the mean of its divisors is an integer number (15784301).
Almost surely, 2152263025 is an apocalyptic number.
It is an amenable number.
152263025 is a deficient number, since it is larger than the sum of its proper divisors (37148587).
152263025 is a wasteful number, since it uses less digits than its factorization.
152263025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19540 (or 19535 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 152263025 is about 12339.4904676004. The cubic root of 152263025 is about 533.9879840844.
The spelling of 152263025 in words is "one hundred fifty-two million, two hundred sixty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •