Base | Representation |
---|---|
bin | 11110001011010… |
… | …00001100101001 |
3 | 122122022112000212 |
4 | 33011220030221 |
5 | 1004300233414 |
6 | 41041310505 |
7 | 6162412601 |
oct | 1705501451 |
9 | 578275025 |
10 | 253133609 |
11 | 11a984033 |
12 | 70935435 |
13 | 4059bb01 |
14 | 25893c01 |
15 | 1735283e |
hex | f168329 |
253133609 has 2 divisors, whose sum is σ = 253133610. Its totient is φ = 253133608.
The previous prime is 253133603. The next prime is 253133633. The reversal of 253133609 is 906331352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 241709209 + 11424400 = 15547^2 + 3380^2 .
It is a cyclic number.
It is not a de Polignac number, because 253133609 - 24 = 253133593 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (253133603) 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, 126566804 + 126566805.
It is an arithmetic number, because the mean of its divisors is an integer number (126566805).
Almost surely, 2253133609 is an apocalyptic number.
It is an amenable number.
253133609 is a deficient number, since it is larger than the sum of its proper divisors (1).
253133609 is an equidigital number, since it uses as much as digits as its factorization.
253133609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 32.
The square root of 253133609 is about 15910.1731291649. The cubic root of 253133609 is about 632.5816703635.
The spelling of 253133609 in words is "two hundred fifty-three million, one hundred thirty-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •