Base | Representation |
---|---|
bin | 1001101001110111… |
… | …11110111010100000 |
3 | 111101012221002202120 |
4 | 10310323332322200 |
5 | 41103333403340 |
6 | 2214151544240 |
7 | 242304452211 |
oct | 46473767240 |
9 | 14335832676 |
10 | 5183106720 |
11 | 221a801880 |
12 | 100798b080 |
13 | 647a7c86c |
14 | 372527408 |
15 | 2050754d0 |
hex | 134efeea0 |
5183106720 has 192 divisors, whose sum is σ = 17847599616. Its totient is φ = 1253934080.
The previous prime is 5183106703. The next prime is 5183106739. The reversal of 5183106720 is 276013815.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 4365967 + ... + 4367153.
It is an arithmetic number, because the mean of its divisors is an integer number (92956248).
Almost surely, 25183106720 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5183106720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8923799808).
5183106720 is an abundant number, since it is smaller than the sum of its proper divisors (12664492896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5183106720 is a wasteful number, since it uses less digits than its factorization.
5183106720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2043 (or 2035 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 5183106720 is about 71993.7963994121. The cubic root of 5183106720 is about 1730.6000702714.
The spelling of 5183106720 in words is "five billion, one hundred eighty-three million, one hundred six thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •