Base | Representation |
---|---|
bin | 1100000000111010… |
… | …00001101100010101 |
3 | 121122111221000000002 |
4 | 12000131001230111 |
5 | 101202203410203 |
6 | 2544011101045 |
7 | 315560414543 |
oct | 60035015425 |
9 | 17574830002 |
10 | 6450060053 |
11 | 280a988648 |
12 | 1300141785 |
13 | 7ba3b6ba8 |
14 | 4528c4d93 |
15 | 27b3d8d88 |
hex | 180741b15 |
6450060053 has 2 divisors, whose sum is σ = 6450060054. Its totient is φ = 6450060052.
The previous prime is 6450060037. The next prime is 6450060109. The reversal of 6450060053 is 3500600546.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6294359569 + 155700484 = 79337^2 + 12478^2 .
It is a cyclic number.
It is not a de Polignac number, because 6450060053 - 24 = 6450060037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6450059998 and 6450060025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6450060653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3225030026 + 3225030027.
It is an arithmetic number, because the mean of its divisors is an integer number (3225030027).
Almost surely, 26450060053 is an apocalyptic number.
It is an amenable number.
6450060053 is a deficient number, since it is larger than the sum of its proper divisors (1).
6450060053 is an equidigital number, since it uses as much as digits as its factorization.
6450060053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 6450060053 is about 80312.2658938222. The cubic root of 6450060053 is about 1861.4637621072.
Adding to 6450060053 its reverse (3500600546), we get a palindrome (9950660599).
The spelling of 6450060053 in words is "six billion, four hundred fifty million, sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •