Base | Representation |
---|---|
bin | 1001011010110011… |
… | …01000011001111001 |
3 | 111001101222222222221 |
4 | 10231121220121321 |
5 | 40324001123423 |
6 | 2153433444041 |
7 | 236210624140 |
oct | 45531503171 |
9 | 14041888887 |
10 | 5056661113 |
11 | 2165398379 |
12 | b91570621 |
13 | 627809b8a |
14 | 35d810757 |
15 | 1e8de9e5d |
hex | 12d668679 |
5056661113 has 32 divisors (see below), whose sum is σ = 6121267200. Its totient is φ = 4083674496.
The previous prime is 5056661111. The next prime is 5056661167. The reversal of 5056661113 is 3111666505.
It is a cyclic number.
It is not a de Polignac number, because 5056661113 - 21 = 5056661111 is a prime.
It is a super-2 number, since 2×50566611132 = 51139643223452797538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5056661111) 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, 5143620 + ... + 5144602.
It is an arithmetic number, because the mean of its divisors is an integer number (191289600).
Almost surely, 25056661113 is an apocalyptic number.
It is an amenable number.
5056661113 is a deficient number, since it is larger than the sum of its proper divisors (1064606087).
5056661113 is a wasteful number, since it uses less digits than its factorization.
5056661113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461.
The product of its (nonzero) digits is 16200, while the sum is 34.
The square root of 5056661113 is about 71110.2040005511. The cubic root of 5056661113 is about 1716.4109758409.
The spelling of 5056661113 in words is "five billion, fifty-six million, six hundred sixty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •