Base | Representation |
---|---|
bin | 10010010001001… |
… | …11001001110101 |
3 | 101200101000212101 |
4 | 21020213021311 |
5 | 303213034334 |
6 | 23112422101 |
7 | 3540424126 |
oct | 1110471165 |
9 | 350330771 |
10 | 153252469 |
11 | 79563937 |
12 | 433a7931 |
13 | 2599a446 |
14 | 164d404d |
15 | d6c3214 |
hex | 9227275 |
153252469 has 2 divisors, whose sum is σ = 153252470. Its totient is φ = 153252468.
The previous prime is 153252419. The next prime is 153252503. The reversal of 153252469 is 964252351.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124768900 + 28483569 = 11170^2 + 5337^2 .
It is a cyclic number.
It is not a de Polignac number, because 153252469 - 211 = 153250421 is a prime.
It is a super-2 number, since 2×1532524692 = 46972638509191922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153252419) 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, 76626234 + 76626235.
It is an arithmetic number, because the mean of its divisors is an integer number (76626235).
Almost surely, 2153252469 is an apocalyptic number.
It is an amenable number.
153252469 is a deficient number, since it is larger than the sum of its proper divisors (1).
153252469 is an equidigital number, since it uses as much as digits as its factorization.
153252469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 64800, while the sum is 37.
The square root of 153252469 is about 12379.5181247091. The cubic root of 153252469 is about 535.1421510642.
The spelling of 153252469 in words is "one hundred fifty-three million, two hundred fifty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •