Base | Representation |
---|---|
bin | 1001100111001000… |
… | …11010101001100010 |
3 | 111022121201212022210 |
4 | 10303210122221202 |
5 | 41031444323100 |
6 | 2212011542550 |
7 | 241605364623 |
oct | 46344325142 |
9 | 14277655283 |
10 | 5160151650 |
11 | 2208853345 |
12 | 100015aa56 |
13 | 6430a3394 |
14 | 36d46da4a |
15 | 20303dc50 |
hex | 13391aa62 |
5160151650 has 96 divisors (see below), whose sum is σ = 13061235456. Its totient is φ = 1347840000.
The previous prime is 5160151643. The next prime is 5160151673. The reversal of 5160151650 is 561510615.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2478610 + ... + 2480690.
It is an arithmetic number, because the mean of its divisors is an integer number (136054536).
Almost surely, 25160151650 is an apocalyptic number.
5160151650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5160151650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6530617728).
5160151650 is an abundant number, since it is smaller than the sum of its proper divisors (7901083806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5160151650 is a wasteful number, since it uses less digits than its factorization.
5160151650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2428 (or 2423 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The square root of 5160151650 is about 71834.1955478030. The cubic root of 5160151650 is about 1728.0414479888.
The spelling of 5160151650 in words is "five billion, one hundred sixty million, one hundred fifty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •