Base | Representation |
---|---|
bin | 11000011001110011100100… |
… | …01000000001001000100001 |
3 | 21001000011012012011100100201 |
4 | 30030321302020001020201 |
5 | 24013204301420210031 |
6 | 310044314512145201 |
7 | 14206020005465536 |
oct | 1414716210011041 |
9 | 231004165140321 |
10 | 53663236100641 |
11 | 1610a4a5865762 |
12 | 6028365238201 |
13 | 23c3562c08abb |
14 | d37458d3cd8d |
15 | 630d85b03d61 |
hex | 30ce72201221 |
53663236100641 has 2 divisors, whose sum is σ = 53663236100642. Its totient is φ = 53663236100640.
The previous prime is 53663236100557. The next prime is 53663236100653. The reversal of 53663236100641 is 14600163236635.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42561545214241 + 11101690886400 = 6523921^2 + 3331920^2 .
It is a cyclic number.
It is not a de Polignac number, because 53663236100641 - 229 = 53662699229729 is a prime.
It is a super-2 number, since 2×536632361006412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53663236100591 and 53663236100600.
It is not a weakly prime, because it can be changed into another prime (53663236100671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26831618050320 + 26831618050321.
It is an arithmetic number, because the mean of its divisors is an integer number (26831618050321).
Almost surely, 253663236100641 is an apocalyptic number.
It is an amenable number.
53663236100641 is a deficient number, since it is larger than the sum of its proper divisors (1).
53663236100641 is an equidigital number, since it uses as much as digits as its factorization.
53663236100641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1399680, while the sum is 46.
The spelling of 53663236100641 in words is "fifty-three trillion, six hundred sixty-three billion, two hundred thirty-six million, one hundred thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •