Base | Representation |
---|---|
bin | 101000000001101000011… |
… | …0000011111010100011000 |
3 | 201110220012100212101020220 |
4 | 1100003100300133110120 |
5 | 1210112132442323000 |
6 | 15411052522120040 |
7 | 1105303256555355 |
oct | 120032060372430 |
9 | 21426170771226 |
10 | 5501060511000 |
11 | 1830a9427862a |
12 | 74a186050020 |
13 | 30b994b47932 |
14 | 15037778962c |
15 | 981664da1a0 |
hex | 500d0c1f518 |
5501060511000 has 128 divisors (see below), whose sum is σ = 17166480327360. Its totient is φ = 1466678400000.
The previous prime is 5501060510941. The next prime is 5501060511029. The reversal of 5501060511000 is 1150601055.
It is a super-2 number, since 2×55010605110002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16336332 + ... + 16669668.
Almost surely, 25501060511000 is an apocalyptic number.
5501060511000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5501060511000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8583240163680).
5501060511000 is an abundant number, since it is smaller than the sum of its proper divisors (11665419816360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5501060511000 is a wasteful number, since it uses less digits than its factorization.
5501060511000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338862 (or 338848 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 5501060511000 in words is "five trillion, five hundred one billion, sixty million, five hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •