Base | Representation |
---|---|
bin | 1010010111011000… |
… | …01001010001111011 |
3 | 112100211012200211001 |
4 | 11023230021101323 |
5 | 42344044041333 |
6 | 2320105345431 |
7 | 254621165425 |
oct | 51354112173 |
9 | 15324180731 |
10 | 5564830843 |
11 | 23a6224860 |
12 | 10b3798277 |
13 | 6a8b92720 |
14 | 3ab0d1815 |
15 | 228828b7d |
hex | 14bb0947b |
5564830843 has 16 divisors (see below), whose sum is σ = 6539825376. Its totient is φ = 4668272640.
The previous prime is 5564830823. The next prime is 5564830861. The reversal of 5564830843 is 3480384655.
It is a cyclic number.
It is not a de Polignac number, because 5564830843 - 221 = 5562733691 is a prime.
It is a super-3 number, since 3×55648308433 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5564830793 and 5564830802.
It is not an unprimeable number, because it can be changed into a prime (5564830823) 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 15 ways as a sum of consecutive naturals, for example, 758971 + ... + 766267.
It is an arithmetic number, because the mean of its divisors is an integer number (408739086).
Almost surely, 25564830843 is an apocalyptic number.
5564830843 is a deficient number, since it is larger than the sum of its proper divisors (974994533).
5564830843 is a wasteful number, since it uses less digits than its factorization.
5564830843 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12654.
The product of its (nonzero) digits is 1382400, while the sum is 46.
The square root of 5564830843 is about 74597.7938212653. The cubic root of 5564830843 is about 1772.0827136518.
The spelling of 5564830843 in words is "five billion, five hundred sixty-four million, eight hundred thirty thousand, eight hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •