Base | Representation |
---|---|
bin | 1001100111010100… |
… | …01001110011111110 |
3 | 111022201120021021210 |
4 | 10303222021303332 |
5 | 41032340434200 |
6 | 2212104105250 |
7 | 241624230312 |
oct | 46352116376 |
9 | 14281507253 |
10 | 5161655550 |
11 | 2209690237 |
12 | 1000765226 |
13 | 6434aba6c |
14 | 36d741b42 |
15 | 203239650 |
hex | 133a89cfe |
5161655550 has 48 divisors (see below), whose sum is σ = 12807430272. Its totient is φ = 1375740000.
The previous prime is 5161655537. The next prime is 5161655557. The reversal of 5161655550 is 555561615.
It is a junction number, because it is equal to n+sod(n) for n = 5161655499 and 5161655508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5161655557) by changing a digit.
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, 330007 + ... + 345293.
It is an arithmetic number, because the mean of its divisors is an integer number (266821464).
Almost surely, 25161655550 is an apocalyptic number.
5161655550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5161655550 is an abundant number, since it is smaller than the sum of its proper divisors (7645774722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5161655550 is a wasteful number, since it uses less digits than its factorization.
5161655550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17553 (or 17548 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 39.
The square root of 5161655550 is about 71844.6626410063. The cubic root of 5161655550 is about 1728.2093079848.
The spelling of 5161655550 in words is "five billion, one hundred sixty-one million, six hundred fifty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •