Base | Representation |
---|---|
bin | 1010011100010100… |
… | …00111100101011101 |
3 | 112110201010122010210 |
4 | 11032022013211131 |
5 | 42440144231103 |
6 | 2324145123033 |
7 | 255633163524 |
oct | 51612074535 |
9 | 15421118123 |
10 | 5606242653 |
11 | 241763a0a0 |
12 | 1105629479 |
13 | 6b4631a5b |
14 | 3b27d14bb |
15 | 22c2a8e03 |
hex | 14e28795d |
5606242653 has 32 divisors (see below), whose sum is σ = 8249270400. Its totient is φ = 3358368000.
The previous prime is 5606242601. The next prime is 5606242669. The reversal of 5606242653 is 3562426065.
It is not a de Polignac number, because 5606242653 - 210 = 5606241629 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5606241653) 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 in 31 ways as a sum of consecutive naturals, for example, 2762043 + ... + 2764071.
It is an arithmetic number, because the mean of its divisors is an integer number (257789700).
Almost surely, 25606242653 is an apocalyptic number.
It is an amenable number.
5606242653 is a deficient number, since it is larger than the sum of its proper divisors (2643027747).
5606242653 is a wasteful number, since it uses less digits than its factorization.
5606242653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2973.
The product of its (nonzero) digits is 259200, while the sum is 39.
The square root of 5606242653 is about 74874.8465975056. The cubic root of 5606242653 is about 1776.4676246991.
The spelling of 5606242653 in words is "five billion, six hundred six million, two hundred forty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •