Base | Representation |
---|---|
bin | 110001011010101001… |
… | …001110111101000011 |
3 | 12001221212102212202012 |
4 | 301122221032331003 |
5 | 1332131423204042 |
6 | 40213043443135 |
7 | 3555612446015 |
oct | 613251167503 |
9 | 161855385665 |
10 | 53060366147 |
11 | 20559214478 |
12 | a3499864ab |
13 | 5007acba79 |
14 | 27d4d6c1b5 |
15 | 15a83aee82 |
hex | c5aa4ef43 |
53060366147 has 2 divisors, whose sum is σ = 53060366148. Its totient is φ = 53060366146.
The previous prime is 53060366137. The next prime is 53060366159. The reversal of 53060366147 is 74166306035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53060366147 - 26 = 53060366083 is a prime.
It is a super-3 number, since 3×530603661473 (a number of 33 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (53060366137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26530183073 + 26530183074.
It is an arithmetic number, because the mean of its divisors is an integer number (26530183074).
Almost surely, 253060366147 is an apocalyptic number.
53060366147 is a deficient number, since it is larger than the sum of its proper divisors (1).
53060366147 is an equidigital number, since it uses as much as digits as its factorization.
53060366147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 41.
The spelling of 53060366147 in words is "fifty-three billion, sixty million, three hundred sixty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •