Base | Representation |
---|---|
bin | 1010110010010010… |
… | …01110111100110111 |
3 | 112221112221221002020 |
4 | 11121021032330313 |
5 | 43324340410210 |
6 | 2354331444223 |
7 | 263331643200 |
oct | 53111167467 |
9 | 15845857066 |
10 | 5790560055 |
11 | 2501690525 |
12 | 11572b6673 |
13 | 713887ac7 |
14 | 3cd0905a7 |
15 | 23d566770 |
hex | 15924ef37 |
5790560055 has 24 divisors (see below), whose sum is σ = 10777533552. Its totient is φ = 2647112832.
The previous prime is 5790560053. The next prime is 5790560057. The reversal of 5790560055 is 5500650975.
It is an interprime number because it is at equal distance from previous prime (5790560053) and next prime (5790560057).
It is not a de Polignac number, because 5790560055 - 21 = 5790560053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5790559989 and 5790560016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5790560053) 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 23 ways as a sum of consecutive naturals, for example, 3938422 + ... + 3939891.
It is an arithmetic number, because the mean of its divisors is an integer number (449063898).
Almost surely, 25790560055 is an apocalyptic number.
5790560055 is a deficient number, since it is larger than the sum of its proper divisors (4986973497).
5790560055 is a wasteful number, since it uses less digits than its factorization.
5790560055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7878335 (or 7878328 counting only the distinct ones).
The product of its (nonzero) digits is 236250, while the sum is 42.
The square root of 5790560055 is about 76095.7295450934. The cubic root of 5790560055 is about 1795.7264931686.
The spelling of 5790560055 in words is "five billion, seven hundred ninety million, five hundred sixty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •