Base | Representation |
---|---|
bin | 11110001011001… |
… | …10000101101001 |
3 | 122122022002011212 |
4 | 33011212011221 |
5 | 1004244444334 |
6 | 41041202505 |
7 | 6162345446 |
oct | 1705460551 |
9 | 578262155 |
10 | 253124969 |
11 | 11a978599 |
12 | 70930435 |
13 | 40597bb6 |
14 | 258909cd |
15 | 1734eece |
hex | f166169 |
253124969 has 2 divisors, whose sum is σ = 253124970. Its totient is φ = 253124968.
The previous prime is 253124957. The next prime is 253124981. The reversal of 253124969 is 969421352.
253124969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (253124957) and next prime (253124981).
It can be written as a sum of positive squares in only one way, i.e., 190081369 + 63043600 = 13787^2 + 7940^2 .
It is a cyclic number.
It is not a de Polignac number, because 253124969 - 24 = 253124953 is a prime.
It is a super-2 number, since 2×2531249692 = 128144499862501922, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (253124999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126562484 + 126562485.
It is an arithmetic number, because the mean of its divisors is an integer number (126562485).
Almost surely, 2253124969 is an apocalyptic number.
It is an amenable number.
253124969 is a deficient number, since it is larger than the sum of its proper divisors (1).
253124969 is an equidigital number, since it uses as much as digits as its factorization.
253124969 is an evil number, because the sum of its binary digits is even.
The product of its digits is 116640, while the sum is 41.
The square root of 253124969 is about 15909.9016024613. The cubic root of 253124969 is about 632.5744731527.
The spelling of 253124969 in words is "two hundred fifty-three million, one hundred twenty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •