Base | Representation |
---|---|
bin | 101000000011101110011… |
… | …1110111101110111111101 |
3 | 201111022210222120120221010 |
4 | 1100013130332331313331 |
5 | 1210200342003200221 |
6 | 15413115234425433 |
7 | 1105522631646504 |
oct | 120073476756775 |
9 | 21438728516833 |
10 | 5505560600061 |
11 | 183299347a0a5 |
12 | 74b021132279 |
13 | 30c231252b22 |
14 | 1506832b983b |
15 | 9832b5e4c76 |
hex | 501dcfbddfd |
5505560600061 has 8 divisors (see below), whose sum is σ = 7441305651520. Its totient is φ = 3620094640992.
The previous prime is 5505560600039. The next prime is 5505560600063. The reversal of 5505560600061 is 1600060655055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5505560600061 - 222 = 5505556405757 is a prime.
It is a super-2 number, since 2×55055606000612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5505560599992 and 5505560600019.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5505560600063) 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, 12569772841 + ... + 12569773278.
It is an arithmetic number, because the mean of its divisors is an integer number (930163206440).
Almost surely, 25505560600061 is an apocalyptic number.
It is an amenable number.
5505560600061 is a deficient number, since it is larger than the sum of its proper divisors (1935745051459).
5505560600061 is a wasteful number, since it uses less digits than its factorization.
5505560600061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25139546195.
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 5505560600061 in words is "five trillion, five hundred five billion, five hundred sixty million, six hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •