Base | Representation |
---|---|
bin | 100100110010011011100… |
… | …0101001000100011111101 |
3 | 122220100200100021220001110 |
4 | 1021210313011020203331 |
5 | 1130314343223200221 |
6 | 14430423543032233 |
7 | 1031201612664660 |
oct | 111446705104375 |
9 | 18810610256043 |
10 | 5056100600061 |
11 | 167a309a81745 |
12 | 697aa5a3b679 |
13 | 2a8a329c36c4 |
14 | 136a063d16d7 |
15 | 8b7c2971776 |
hex | 499371488fd |
5056100600061 has 8 divisors (see below), whose sum is σ = 7704534247744. Its totient is φ = 2889200342880.
The previous prime is 5056100600029. The next prime is 5056100600093. The reversal of 5056100600061 is 1600060016505.
It is an interprime number because it is at equal distance from previous prime (5056100600029) and next prime (5056100600093).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5056100600061 - 25 = 5056100600029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5056100650061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120383347600 + ... + 120383347641.
It is an arithmetic number, because the mean of its divisors is an integer number (963066780968).
Almost surely, 25056100600061 is an apocalyptic number.
It is an amenable number.
5056100600061 is a deficient number, since it is larger than the sum of its proper divisors (2648433647683).
5056100600061 is a wasteful number, since it uses less digits than its factorization.
5056100600061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240766695251.
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 5056100600061 its reverse (1600060016505), we get a palindrome (6656160616566).
The spelling of 5056100600061 in words is "five trillion, fifty-six billion, one hundred million, six hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •