Base | Representation |
---|---|
bin | 110001111110111110… |
… | …101001110101000111 |
3 | 12010112100111111201111 |
4 | 301332332221311013 |
5 | 1334404002223111 |
6 | 40353341305451 |
7 | 3606664066411 |
oct | 617676516507 |
9 | 163470444644 |
10 | 53669961031 |
11 | 208413260a5 |
12 | a499b65287 |
13 | 50a41a69bb |
14 | 2851cd19b1 |
15 | 15e1b75a21 |
hex | c7efa9d47 |
53669961031 has 2 divisors, whose sum is σ = 53669961032. Its totient is φ = 53669961030.
The previous prime is 53669961011. The next prime is 53669961089. The reversal of 53669961031 is 13016996635.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53669961031 - 213 = 53669952839 is a prime.
It is a super-2 number, since 2×536699610312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53669961011) 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, 26834980515 + 26834980516.
It is an arithmetic number, because the mean of its divisors is an integer number (26834980516).
Almost surely, 253669961031 is an apocalyptic number.
53669961031 is a deficient number, since it is larger than the sum of its proper divisors (1).
53669961031 is an equidigital number, since it uses as much as digits as its factorization.
53669961031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 787320, while the sum is 49.
The spelling of 53669961031 in words is "fifty-three billion, six hundred sixty-nine million, nine hundred sixty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •