Base | Representation |
---|---|
bin | 10010001100010… |
… | …11000010111101 |
3 | 101122011112202022 |
4 | 21012023002331 |
5 | 303032104203 |
6 | 23051005525 |
7 | 3532122005 |
oct | 1106130275 |
9 | 348145668 |
10 | 152613053 |
11 | 7916749a |
12 | 431398a5 |
13 | 258053a8 |
14 | 163a9005 |
15 | d5e8a38 |
hex | 918b0bd |
152613053 has 2 divisors, whose sum is σ = 152613054. Its totient is φ = 152613052.
The previous prime is 152613037. The next prime is 152613061. The reversal of 152613053 is 350316251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82773604 + 69839449 = 9098^2 + 8357^2 .
It is a cyclic number.
It is not a de Polignac number, because 152613053 - 24 = 152613037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152613953) 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 as a sum of consecutive naturals, namely, 76306526 + 76306527.
It is an arithmetic number, because the mean of its divisors is an integer number (76306527).
Almost surely, 2152613053 is an apocalyptic number.
It is an amenable number.
152613053 is a deficient number, since it is larger than the sum of its proper divisors (1).
152613053 is an equidigital number, since it uses as much as digits as its factorization.
152613053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 152613053 is about 12353.6655693766. The cubic root of 152613053 is about 534.3968548589.
The spelling of 152613053 in words is "one hundred fifty-two million, six hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •