Base | Representation |
---|---|
bin | 10010001101110… |
… | …01110010101001 |
3 | 101122112021101201 |
4 | 21012321302221 |
5 | 303104221041 |
6 | 23055044201 |
7 | 3533550142 |
oct | 1106716251 |
9 | 348467351 |
10 | 152804521 |
11 | 79288331 |
12 | 43210661 |
13 | 2587159c |
14 | 16418ac9 |
15 | d635631 |
hex | 91b9ca9 |
152804521 has 2 divisors, whose sum is σ = 152804522. Its totient is φ = 152804520.
The previous prime is 152804503. The next prime is 152804537. The reversal of 152804521 is 125408251.
152804521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 151782400 + 1022121 = 12320^2 + 1011^2 .
It is a cyclic number.
It is not a de Polignac number, because 152804521 - 29 = 152804009 is a prime.
It is a super-3 number, since 3×1528045213 (a number of 26 digits) contains 333 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 152804521.
It is not a weakly prime, because it can be changed into another prime (152804221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76402260 + 76402261.
It is an arithmetic number, because the mean of its divisors is an integer number (76402261).
Almost surely, 2152804521 is an apocalyptic number.
It is an amenable number.
152804521 is a deficient number, since it is larger than the sum of its proper divisors (1).
152804521 is an equidigital number, since it uses as much as digits as its factorization.
152804521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3200, while the sum is 28.
The square root of 152804521 is about 12361.4125810928. The cubic root of 152804521 is about 534.6202458352.
The spelling of 152804521 in words is "one hundred fifty-two million, eight hundred four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •