Base | Representation |
---|---|
bin | 1001101100101101… |
… | …01101000111111100 |
3 | 111102212200100212010 |
4 | 10312112231013330 |
5 | 41130430421311 |
6 | 2220401411220 |
7 | 243013553163 |
oct | 46626550774 |
9 | 14385610763 |
10 | 5206888956 |
11 | 2232175815 |
12 | 1013939b10 |
13 | 64c9886a9 |
14 | 3757583da |
15 | 2071c1da6 |
hex | 1365ad1fc |
5206888956 has 48 divisors (see below), whose sum is σ = 12288534048. Its totient is φ = 1715808000.
The previous prime is 5206888949. The next prime is 5206888957. The reversal of 5206888956 is 6598886025.
It is a super-2 number, since 2×52068889562 = 54223385200229539872, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5206888896 and 5206888905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5206888957) 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 15 ways as a sum of consecutive naturals, for example, 885466 + ... + 891326.
It is an arithmetic number, because the mean of its divisors is an integer number (256011126).
Almost surely, 25206888956 is an apocalyptic number.
It is an amenable number.
5206888956 is an abundant number, since it is smaller than the sum of its proper divisors (7081645092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5206888956 is a wasteful number, since it uses less digits than its factorization.
5206888956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6702 (or 6700 counting only the distinct ones).
The product of its (nonzero) digits is 8294400, while the sum is 57.
The square root of 5206888956 is about 72158.7760151182. The cubic root of 5206888956 is about 1733.2429350127.
The spelling of 5206888956 in words is "five billion, two hundred six million, eight hundred eighty-eight thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •