Base | Representation |
---|---|
bin | 1110110001000101010… |
… | …0010100110010110111 |
3 | 220020211100021202010202 |
4 | 3230101110110302313 |
5 | 13124031031024231 |
6 | 312313434311115 |
7 | 24220523054336 |
oct | 3542124246267 |
9 | 806740252122 |
10 | 253693611191 |
11 | 9865547aa89 |
12 | 4120158849b |
13 | 1ac00386847 |
14 | c3c91abd1d |
15 | 68ec21c5cb |
hex | 3b11514cb7 |
253693611191 has 2 divisors, whose sum is σ = 253693611192. Its totient is φ = 253693611190.
The previous prime is 253693611049. The next prime is 253693611209. The reversal of 253693611191 is 191116396352.
253693611191 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 253693611191 - 230 = 252619869367 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253693611491) 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, 126846805595 + 126846805596.
It is an arithmetic number, because the mean of its divisors is an integer number (126846805596).
Almost surely, 2253693611191 is an apocalyptic number.
253693611191 is a deficient number, since it is larger than the sum of its proper divisors (1).
253693611191 is an equidigital number, since it uses as much as digits as its factorization.
253693611191 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 262440, while the sum is 47.
The spelling of 253693611191 in words is "two hundred fifty-three billion, six hundred ninety-three million, six hundred eleven thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •