Base | Representation |
---|---|
bin | 1011011000011000… |
… | …10011011101010101 |
3 | 120202211021212110011 |
4 | 11230030103131111 |
5 | 100003143211203 |
6 | 2450145200221 |
7 | 304262160034 |
oct | 55414233525 |
9 | 16684255404 |
10 | 6110132053 |
11 | 2656012713 |
12 | 1226330071 |
13 | 764b4926c |
14 | 41d6ba71b |
15 | 25b63e76d |
hex | 16c313755 |
6110132053 has 2 divisors, whose sum is σ = 6110132054. Its totient is φ = 6110132052.
The previous prime is 6110131991. The next prime is 6110132069. The reversal of 6110132053 is 3502310116.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3069381604 + 3040750449 = 55402^2 + 55143^2 .
It is a cyclic number.
It is not a de Polignac number, because 6110132053 - 29 = 6110131541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6110132153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3055066026 + 3055066027.
It is an arithmetic number, because the mean of its divisors is an integer number (3055066027).
Almost surely, 26110132053 is an apocalyptic number.
It is an amenable number.
6110132053 is a deficient number, since it is larger than the sum of its proper divisors (1).
6110132053 is an equidigital number, since it uses as much as digits as its factorization.
6110132053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 6110132053 is about 78167.3336695067. Note that the first 3 decimals coincide. The cubic root of 6110132053 is about 1828.1712102447.
Adding to 6110132053 its reverse (3502310116), we get a palindrome (9612442169).
The spelling of 6110132053 in words is "six billion, one hundred ten million, one hundred thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •