Base | Representation |
---|---|
bin | 1001011101000100… |
… | …01011100110111000 |
3 | 111002201210020120000 |
4 | 10232202023212320 |
5 | 40343333222142 |
6 | 2155353233000 |
7 | 236531364630 |
oct | 45642134670 |
9 | 14081706500 |
10 | 5075679672 |
11 | 21750a8298 |
12 | b97a02760 |
13 | 62b73866b |
14 | 3621616c0 |
15 | 1ea90514c |
hex | 12e88b9b8 |
5075679672 has 160 divisors (see below), whose sum is σ = 16332096000. Its totient is φ = 1442650176.
The previous prime is 5075679617. The next prime is 5075679691. The reversal of 5075679672 is 2769765705.
5075679672 is a `hidden beast` number, since 5 + 0 + 7 + 567 + 9 + 6 + 72 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 899853 + ... + 905475.
It is an arithmetic number, because the mean of its divisors is an integer number (102075600).
Almost surely, 25075679672 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 5075679672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8166048000).
5075679672 is an abundant number, since it is smaller than the sum of its proper divisors (11256416328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5075679672 is a wasteful number, since it uses less digits than its factorization.
5075679672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5847 (or 5834 counting only the distinct ones).
The product of its (nonzero) digits is 5556600, while the sum is 54.
The square root of 5075679672 is about 71243.8044464219. The cubic root of 5075679672 is about 1718.5601425689.
The spelling of 5075679672 in words is "five billion, seventy-five million, six hundred seventy-nine thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •