Base | Representation |
---|---|
bin | 11000011001110111010110… |
… | …00100001010010110010111 |
3 | 21001000100102121010212102112 |
4 | 30030323223010022112113 |
5 | 24013222430333223301 |
6 | 310045252113301235 |
7 | 14206121204125613 |
oct | 1414735304122627 |
9 | 231010377125375 |
10 | 53665265132951 |
11 | 1611034713176a |
12 | 602883086481b |
13 | 23c37c73a9834 |
14 | d375ac5d4343 |
15 | 630e53ced9bb |
hex | 30ceeb10a597 |
53665265132951 has 2 divisors, whose sum is σ = 53665265132952. Its totient is φ = 53665265132950.
The previous prime is 53665265132903. The next prime is 53665265132953. The reversal of 53665265132951 is 15923156256635.
53665265132951 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-53665265132951 is a prime.
Together with 53665265132953, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53665265132953) 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, 26832632566475 + 26832632566476.
It is an arithmetic number, because the mean of its divisors is an integer number (26832632566476).
Almost surely, 253665265132951 is an apocalyptic number.
53665265132951 is a deficient number, since it is larger than the sum of its proper divisors (1).
53665265132951 is an equidigital number, since it uses as much as digits as its factorization.
53665265132951 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 43740000, while the sum is 59.
The spelling of 53665265132951 in words is "fifty-three trillion, six hundred sixty-five billion, two hundred sixty-five million, one hundred thirty-two thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •