Base | Representation |
---|---|
bin | 1011010000101100… |
… | …01001101011001001 |
3 | 120121022212112100202 |
4 | 11220112021223021 |
5 | 44340133321203 |
6 | 2435522141545 |
7 | 302546535152 |
oct | 55026115311 |
9 | 16538775322 |
10 | 6045604553 |
11 | 262264a1aa |
12 | 12087b18b5 |
13 | 754675601 |
14 | 414cc0929 |
15 | 255b45388 |
hex | 168589ac9 |
6045604553 has 2 divisors, whose sum is σ = 6045604554. Its totient is φ = 6045604552.
The previous prime is 6045604541. The next prime is 6045604577. The reversal of 6045604553 is 3554065406.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5368199824 + 677404729 = 73268^2 + 26027^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6045604553 is a prime.
It is a super-2 number, since 2×60456045532 = 73098668822508659618, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (6045684553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3022802276 + 3022802277.
It is an arithmetic number, because the mean of its divisors is an integer number (3022802277).
Almost surely, 26045604553 is an apocalyptic number.
It is an amenable number.
6045604553 is a deficient number, since it is larger than the sum of its proper divisors (1).
6045604553 is an equidigital number, since it uses as much as digits as its factorization.
6045604553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 38.
The square root of 6045604553 is about 77753.4857932427. The cubic root of 6045604553 is about 1821.7128094317.
Adding to 6045604553 its reverse (3554065406), we get a palindrome (9599669959).
The spelling of 6045604553 in words is "six billion, forty-five million, six hundred four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •