Base | Representation |
---|---|
bin | 101000000001101000110… |
… | …1100110101100010011000 |
3 | 201110220020110122002201210 |
4 | 1100003101230311202120 |
5 | 1210112201020040043 |
6 | 15411054245143120 |
7 | 1105303541203653 |
oct | 120032154654230 |
9 | 21426213562653 |
10 | 5501076330648 |
11 | 1830aa21a3118 |
12 | 74a18b3baaa0 |
13 | 30b9981c6382 |
14 | 15037990689a |
15 | 98167ab2633 |
hex | 500d1b35898 |
5501076330648 has 64 divisors (see below), whose sum is σ = 14482677081600. Its totient is φ = 1736442748800.
The previous prime is 5501076330613. The next prime is 5501076330683. The reversal of 5501076330648 is 8460336701055.
It is an interprime number because it is at equal distance from previous prime (5501076330613) and next prime (5501076330683).
It is a junction number, because it is equal to n+sod(n) for n = 5501076330597 and 5501076330606.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1493611 + ... + 3637722.
It is an arithmetic number, because the mean of its divisors is an integer number (226291829400).
Almost surely, 25501076330648 is an apocalyptic number.
It is an amenable number.
5501076330648 is an abundant number, since it is smaller than the sum of its proper divisors (8981600750952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5501076330648 is a wasteful number, since it uses less digits than its factorization.
5501076330648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5133712 (or 5133708 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 48.
The spelling of 5501076330648 in words is "five trillion, five hundred one billion, seventy-six million, three hundred thirty thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •