Base | Representation |
---|---|
bin | 11000001110000000000010… |
… | …10110011001110111011011 |
3 | 20222120101012220111012222212 |
4 | 30013000001112121313123 |
5 | 23440033044440330411 |
6 | 305134113405505335 |
7 | 14134510254161102 |
oct | 1407000126316733 |
9 | 228511186435885 |
10 | 53257617120731 |
11 | 15a73479494611 |
12 | 5b8182427224b |
13 | 239423042929a |
14 | d2197a7d1039 |
15 | 625545c8768b |
hex | 307001599ddb |
53257617120731 has 2 divisors, whose sum is σ = 53257617120732. Its totient is φ = 53257617120730.
The previous prime is 53257617120691. The next prime is 53257617120749. The reversal of 53257617120731 is 13702171675235.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53257617120731 - 238 = 52982739213787 is a prime.
It is a super-2 number, since 2×532576171207312 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53257617120731.
It is not a weakly prime, because it can be changed into another prime (53257617120031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26628808560365 + 26628808560366.
It is an arithmetic number, because the mean of its divisors is an integer number (26628808560366).
Almost surely, 253257617120731 is an apocalyptic number.
53257617120731 is a deficient number, since it is larger than the sum of its proper divisors (1).
53257617120731 is an equidigital number, since it uses as much as digits as its factorization.
53257617120731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1852200, while the sum is 50.
Adding to 53257617120731 its reverse (13702171675235), we get a palindrome (66959788795966).
The spelling of 53257617120731 in words is "fifty-three trillion, two hundred fifty-seven billion, six hundred seventeen million, one hundred twenty thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •