Base | Representation |
---|---|
bin | 101000000001001010011… |
… | …0110101100101011000101 |
3 | 201110210121022202211000212 |
4 | 1100002110312230223011 |
5 | 1210103103202134410 |
6 | 15410405101245205 |
7 | 1105236334266443 |
oct | 120022466545305 |
9 | 21423538684025 |
10 | 5500055505605 |
11 | 1830618a46161 |
12 | 749b45563805 |
13 | 30b86487739b |
14 | 1502c00d7b93 |
15 | 9810816ab05 |
hex | 50094dacac5 |
5500055505605 has 8 divisors (see below), whose sum is σ = 6665413801464. Its totient is φ = 4356479608000.
The previous prime is 5500055505601. The next prime is 5500055505611. The reversal of 5500055505605 is 5065055500055.
It can be written as a sum of positive squares in 4 ways, for example, as 3532471383169 + 1967584122436 = 1879487^2 + 1402706^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5500055505605 - 22 = 5500055505601 is a prime.
It is a super-2 number, since 2×55000555056052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5500055505601) 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, 5445599006 + ... + 5445600015.
It is an arithmetic number, because the mean of its divisors is an integer number (833176725183).
Almost surely, 25500055505605 is an apocalyptic number.
It is an amenable number.
5500055505605 is a deficient number, since it is larger than the sum of its proper divisors (1165358295859).
5500055505605 is a wasteful number, since it uses less digits than its factorization.
5500055505605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10891199127.
The product of its (nonzero) digits is 468750, while the sum is 41.
The spelling of 5500055505605 in words is "five trillion, five hundred billion, fifty-five million, five hundred five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •