Base | Representation |
---|---|
bin | 1110101111110101100… |
… | …0101101000101100111 |
3 | 220012222001001122201211 |
4 | 3223331120231011213 |
5 | 13122334424334301 |
6 | 312220331132251 |
7 | 24206322536233 |
oct | 3537530550547 |
9 | 805861048654 |
10 | 253359214951 |
11 | 984a3743157 |
12 | 411295a4087 |
13 | 1ab79004a4b |
14 | c396a035c3 |
15 | 68ccbb7051 |
hex | 3afd62d167 |
253359214951 has 2 divisors, whose sum is σ = 253359214952. Its totient is φ = 253359214950.
The previous prime is 253359214949. The next prime is 253359215027. The reversal of 253359214951 is 159412953352.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 253359214951 - 21 = 253359214949 is a prime.
Together with 253359214949, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 253359214895 and 253359214904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253359214351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126679607475 + 126679607476.
It is an arithmetic number, because the mean of its divisors is an integer number (126679607476).
Almost surely, 2253359214951 is an apocalyptic number.
253359214951 is a deficient number, since it is larger than the sum of its proper divisors (1).
253359214951 is an equidigital number, since it uses as much as digits as its factorization.
253359214951 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1458000, while the sum is 49.
The spelling of 253359214951 in words is "two hundred fifty-three billion, three hundred fifty-nine million, two hundred fourteen thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •