Base | Representation |
---|---|
bin | 110001011011001010… |
… | …011010101110110011 |
3 | 12001222110210211112002 |
4 | 301123022122232303 |
5 | 1332141140041024 |
6 | 40213554124215 |
7 | 3556046416346 |
oct | 613312325663 |
9 | 161873724462 |
10 | 53069065139 |
11 | 20563116122 |
12 | a35088066b |
13 | 50098563bc |
14 | 27d619445d |
15 | 15a902c6ae |
hex | c5b29abb3 |
53069065139 has 2 divisors, whose sum is σ = 53069065140. Its totient is φ = 53069065138.
The previous prime is 53069065103. The next prime is 53069065211. The reversal of 53069065139 is 93156096035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53069065139 - 212 = 53069061043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53069065093 and 53069065102.
It is not a weakly prime, because it can be changed into another prime (53069865139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26534532569 + 26534532570.
It is an arithmetic number, because the mean of its divisors is an integer number (26534532570).
Almost surely, 253069065139 is an apocalyptic number.
53069065139 is a deficient number, since it is larger than the sum of its proper divisors (1).
53069065139 is an equidigital number, since it uses as much as digits as its factorization.
53069065139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 656100, while the sum is 47.
The spelling of 53069065139 in words is "fifty-three billion, sixty-nine million, sixty-five thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •