Base | Representation |
---|---|
bin | 1010011101111110… |
… | …00010101010001111 |
3 | 112111200020110221120 |
4 | 11032333002222033 |
5 | 43002222203421 |
6 | 2325402332023 |
7 | 256162125111 |
oct | 51677025217 |
9 | 15450213846 |
10 | 5620116111 |
11 | 2424455465 |
12 | 110a1ba013 |
13 | 6b747b6bc |
14 | 3b45a33b1 |
15 | 22d5e98c6 |
hex | 14efc2a8f |
5620116111 has 8 divisors (see below), whose sum is σ = 7616332464. Its totient is φ = 3685321920.
The previous prime is 5620116109. The next prime is 5620116119. The reversal of 5620116111 is 1116110265.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5620116111 - 21 = 5620116109 is a prime.
It is a super-2 number, since 2×56201161112 = 63171410202243528642, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5620116119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15355326 + ... + 15355691.
It is an arithmetic number, because the mean of its divisors is an integer number (952041558).
Almost surely, 25620116111 is an apocalyptic number.
5620116111 is a deficient number, since it is larger than the sum of its proper divisors (1996216353).
5620116111 is a wasteful number, since it uses less digits than its factorization.
5620116111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30711081.
The product of its (nonzero) digits is 360, while the sum is 24.
The square root of 5620116111 is about 74967.4336695608. The cubic root of 5620116111 is about 1777.9317929240.
Adding to 5620116111 its reverse (1116110265), we get a palindrome (6736226376).
The spelling of 5620116111 in words is "five billion, six hundred twenty million, one hundred sixteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •