Base | Representation |
---|---|
bin | 1001010100110100… |
… | …11111011111100010 |
3 | 110220220201100110220 |
4 | 10222122133133202 |
5 | 40223134230411 |
6 | 2144443503510 |
7 | 235032005400 |
oct | 45232373742 |
9 | 13826640426 |
10 | 5006555106 |
11 | 213a084a53 |
12 | b78827b96 |
13 | 61a315457 |
14 | 356cca470 |
15 | 1e47edb06 |
hex | 12a69f7e2 |
5006555106 has 48 divisors (see below), whose sum is σ = 11719475424. Its totient is φ = 1421654976.
The previous prime is 5006555051. The next prime is 5006555111. The reversal of 5006555106 is 6015556005.
It is a super-3 number, since 3×50065551063 (a number of 30 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4315 + ... + 100158.
It is an arithmetic number, because the mean of its divisors is an integer number (244155738).
Almost surely, 25006555106 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5006555106, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5859737712).
5006555106 is an abundant number, since it is smaller than the sum of its proper divisors (6712920318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5006555106 is a wasteful number, since it uses less digits than its factorization.
5006555106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104655 (or 104648 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The square root of 5006555106 is about 70757.0145356628. The cubic root of 5006555106 is about 1710.7228919239.
The spelling of 5006555106 in words is "five billion, six million, five hundred fifty-five thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •