Base | Representation |
---|---|
bin | 100101000110111001100… |
… | …0000001100001011000101 |
3 | 200001120010122101202022111 |
4 | 1022031303000030023011 |
5 | 1132024403214010203 |
6 | 14502533323301021 |
7 | 1034316063262105 |
oct | 112156300141305 |
9 | 20046118352274 |
10 | 5100055610053 |
11 | 1696a15485288 |
12 | 6a451237a771 |
13 | 2acc19274761 |
14 | 138bb5d61205 |
15 | 8c9e679326d |
hex | 4a37300c2c5 |
5100055610053 has 2 divisors, whose sum is σ = 5100055610054. Its totient is φ = 5100055610052.
The previous prime is 5100055610051. The next prime is 5100055610057. The reversal of 5100055610053 is 3500165500015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3246490447204 + 1853565162849 = 1801802^2 + 1361457^2 .
It is a cyclic number.
It is not a de Polignac number, because 5100055610053 - 21 = 5100055610051 is a prime.
Together with 5100055610051, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5100055609997 and 5100055610024.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5100055610051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550027805026 + 2550027805027.
It is an arithmetic number, because the mean of its divisors is an integer number (2550027805027).
Almost surely, 25100055610053 is an apocalyptic number.
It is an amenable number.
5100055610053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100055610053 is an equidigital number, since it uses as much as digits as its factorization.
5100055610053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 5100055610053 in words is "five trillion, one hundred billion, fifty-five million, six hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •