Base | Representation |
---|---|
bin | 10111001100011110000110… |
… | …01001001101010101101101 |
3 | 20200121010102120121100221002 |
4 | 23212033003021031111231 |
5 | 23141140302204023203 |
6 | 300251500544050045 |
7 | 13513030330501421 |
oct | 1346170311152555 |
9 | 220533376540832 |
10 | 51006010611053 |
11 | 152855892a2033 |
12 | 5879381903925 |
13 | 225cb000312b4 |
14 | c849c0022b81 |
15 | 5d6bb3e07d88 |
hex | 2e63c324d56d |
51006010611053 has 2 divisors, whose sum is σ = 51006010611054. Its totient is φ = 51006010611052.
The previous prime is 51006010611007. The next prime is 51006010611109. The reversal of 51006010611053 is 35011601060015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34180369574404 + 16825641036649 = 5846398^2 + 4101907^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51006010611053 is a prime.
It is a super-2 number, since 2×510060106110532 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51006010601053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25503005305526 + 25503005305527.
It is an arithmetic number, because the mean of its divisors is an integer number (25503005305527).
Almost surely, 251006010611053 is an apocalyptic number.
It is an amenable number.
51006010611053 is a deficient number, since it is larger than the sum of its proper divisors (1).
51006010611053 is an equidigital number, since it uses as much as digits as its factorization.
51006010611053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 51006010611053 its reverse (35011601060015), we get a palindrome (86017611671068).
The spelling of 51006010611053 in words is "fifty-one trillion, six billion, ten million, six hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •