Base | Representation |
---|---|
bin | 1110101111010000010… |
… | …1011010001000100111 |
3 | 220012120011102022211112 |
4 | 3223310011122020213 |
5 | 13122030002133024 |
6 | 312153034255235 |
7 | 24202416235301 |
oct | 3536405321047 |
9 | 805504368745 |
10 | 253203161639 |
11 | 98423646a7a |
12 | 410a528751b |
13 | 1ab528967cc |
14 | c37ddc0971 |
15 | 68be13e00e |
hex | 3af415a227 |
253203161639 has 2 divisors, whose sum is σ = 253203161640. Its totient is φ = 253203161638.
The previous prime is 253203161597. The next prime is 253203161677. The reversal of 253203161639 is 936161302352.
253203161639 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 not a de Polignac number, because 253203161639 - 216 = 253203096103 is a prime.
It is a super-2 number, since 2×2532031616392 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 253203161596 and 253203161605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253203161039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126601580819 + 126601580820.
It is an arithmetic number, because the mean of its divisors is an integer number (126601580820).
Almost surely, 2253203161639 is an apocalyptic number.
253203161639 is a deficient number, since it is larger than the sum of its proper divisors (1).
253203161639 is an equidigital number, since it uses as much as digits as its factorization.
253203161639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 41.
The spelling of 253203161639 in words is "two hundred fifty-three billion, two hundred three million, one hundred sixty-one thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •