Base | Representation |
---|---|
bin | 11000001111100100000101… |
… | …11001101111111100001001 |
3 | 20222202111212021020010201101 |
4 | 30013302002321233330021 |
5 | 23441423101021121401 |
6 | 305214515332421401 |
7 | 14141421314242036 |
oct | 1407620271577411 |
9 | 228674767203641 |
10 | 53311330254601 |
11 | 15a94232118041 |
12 | 5b90114777861 |
13 | 239931053aa33 |
14 | d243d432038d |
15 | 626b3b5da101 |
hex | 307c82e6ff09 |
53311330254601 has 2 divisors, whose sum is σ = 53311330254602. Its totient is φ = 53311330254600.
The previous prime is 53311330254529. The next prime is 53311330254647. The reversal of 53311330254601 is 10645203311335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 44003003842576 + 9308326412025 = 6633476^2 + 3050955^2 .
It is a cyclic number.
It is not a de Polignac number, because 53311330254601 - 211 = 53311330252553 is a prime.
It is a super-3 number, since 3×533113302546013 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (53311330254401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26655665127300 + 26655665127301.
It is an arithmetic number, because the mean of its divisors is an integer number (26655665127301).
Almost surely, 253311330254601 is an apocalyptic number.
It is an amenable number.
53311330254601 is a deficient number, since it is larger than the sum of its proper divisors (1).
53311330254601 is an equidigital number, since it uses as much as digits as its factorization.
53311330254601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 97200, while the sum is 37.
Adding to 53311330254601 its reverse (10645203311335), we get a palindrome (63956533565936).
The spelling of 53311330254601 in words is "fifty-three trillion, three hundred eleven billion, three hundred thirty million, two hundred fifty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •