Base | Representation |
---|---|
bin | 1001101001011110… |
… | …11010001101111000 |
3 | 111100222201122110000 |
4 | 10310233122031320 |
5 | 41102012420210 |
6 | 2213553153000 |
7 | 242234443602 |
oct | 46457321570 |
9 | 14328648400 |
10 | 5179810680 |
11 | 2218960480 |
12 | 100685b760 |
13 | 647197545 |
14 | 371d0a172 |
15 | 204b23ac0 |
hex | 134bda378 |
5179810680 has 640 divisors, whose sum is σ = 20323353600. Its totient is φ = 1170892800.
The previous prime is 5179810673. The next prime is 5179810693. The reversal of 5179810680 is 860189715.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 58200076 + ... + 58200164.
It is an arithmetic number, because the mean of its divisors is an integer number (31755240).
It is a vampire number, since it can be written as 56871 ⋅ 91080 (with its own digits).
Almost surely, 25179810680 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 5179810680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10161676800).
5179810680 is an abundant number, since it is smaller than the sum of its proper divisors (15143542920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5179810680 is a wasteful number, since it uses less digits than its factorization.
5179810680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217 (or 204 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 45.
The square root of 5179810680 is about 71970.9016200297. The cubic root of 5179810680 is about 1730.2331515543.
The spelling of 5179810680 in words is "five billion, one hundred seventy-nine million, eight hundred ten thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •