Base | Representation |
---|---|
bin | 11110010001010… |
… | …00011100001101 |
3 | 122200210112011212 |
4 | 33020220130031 |
5 | 1010000433122 |
6 | 41110224205 |
7 | 6202202366 |
oct | 1710503415 |
9 | 580715155 |
10 | 253921037 |
11 | 1203716a7 |
12 | 71055065 |
13 | 407b6346 |
14 | 25a1ab6d |
15 | 1745ace2 |
hex | f22870d |
253921037 has 2 divisors, whose sum is σ = 253921038. Its totient is φ = 253921036.
The previous prime is 253921033. The next prime is 253921069. The reversal of 253921037 is 730129352.
It is an a-pointer prime, because the next prime (253921069) can be obtained adding 253921037 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 242456041 + 11464996 = 15571^2 + 3386^2 .
It is a cyclic number.
It is not a de Polignac number, because 253921037 - 22 = 253921033 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 253920994 and 253921012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253921033) 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, 126960518 + 126960519.
It is an arithmetic number, because the mean of its divisors is an integer number (126960519).
Almost surely, 2253921037 is an apocalyptic number.
It is an amenable number.
253921037 is a deficient number, since it is larger than the sum of its proper divisors (1).
253921037 is an equidigital number, since it uses as much as digits as its factorization.
253921037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 32.
The square root of 253921037 is about 15934.8999683086. The cubic root of 253921037 is about 633.2369197341.
The spelling of 253921037 in words is "two hundred fifty-three million, nine hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •