Base | Representation |
---|---|
bin | 11110001010100… |
… | …10111100000011 |
3 | 122122011002120202 |
4 | 33011102330003 |
5 | 1004234442111 |
6 | 41035355415 |
7 | 6161600663 |
oct | 1705227403 |
9 | 578132522 |
10 | 253046531 |
11 | 11a924671 |
12 | 708b2b6b |
13 | 4056b29a |
14 | 258701a3 |
15 | 17336b3b |
hex | f152f03 |
253046531 has 2 divisors, whose sum is σ = 253046532. Its totient is φ = 253046530.
The previous prime is 253046501. The next prime is 253046533. The reversal of 253046531 is 135640352.
253046531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-253046531 is a prime.
It is a super-2 number, since 2×2530465312 = 128065093702267922, which contains 22 as substring.
Together with 253046533, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 253046494 and 253046503.
It is not a weakly prime, because it can be changed into another prime (253046533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126523265 + 126523266.
It is an arithmetic number, because the mean of its divisors is an integer number (126523266).
Almost surely, 2253046531 is an apocalyptic number.
253046531 is a deficient number, since it is larger than the sum of its proper divisors (1).
253046531 is an equidigital number, since it uses as much as digits as its factorization.
253046531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 253046531 is about 15907.4363427926. The cubic root of 253046531 is about 632.5091259808.
Adding to 253046531 its reverse (135640352), we get a palindrome (388686883).
The spelling of 253046531 in words is "two hundred fifty-three million, forty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •