Base | Representation |
---|---|
bin | 100100011000010101011… |
… | …1001001001001101101001 |
3 | 122201000000212221110202210 |
4 | 1020300222321021031221 |
5 | 1123410111224234221 |
6 | 14344555131515333 |
7 | 1024146120655332 |
oct | 110605271111551 |
9 | 18630025843683 |
10 | 5000061555561 |
11 | 1658572440126 |
12 | 6890665b8b49 |
13 | 2a3671a67287 |
14 | 13400ba0b289 |
15 | 8a0e2d30276 |
hex | 48c2ae49369 |
5000061555561 has 32 divisors (see below), whose sum is σ = 6994461957120. Its totient is φ = 3172787553600.
The previous prime is 5000061555553. The next prime is 5000061555589. The reversal of 5000061555561 is 1655551600005.
It is not a de Polignac number, because 5000061555561 - 23 = 5000061555553 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5000061555361) 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 31 ways as a sum of consecutive naturals, for example, 73614426 + ... + 73682316.
It is an arithmetic number, because the mean of its divisors is an integer number (218576936160).
Almost surely, 25000061555561 is an apocalyptic number.
It is an amenable number.
5000061555561 is a deficient number, since it is larger than the sum of its proper divisors (1994400401559).
5000061555561 is a wasteful number, since it uses less digits than its factorization.
5000061555561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79917.
The product of its (nonzero) digits is 112500, while the sum is 39.
The spelling of 5000061555561 in words is "five trillion, sixty-one million, five hundred fifty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •