Base | Representation |
---|---|
bin | 1100011111111110… |
… | …00100000000000010 |
3 | 122022200020212101000 |
4 | 12033333010000002 |
5 | 102220411000032 |
6 | 3025520152430 |
7 | 325203334656 |
oct | 61777040002 |
9 | 18280225330 |
10 | 6710640642 |
11 | 2933a88702 |
12 | 1373468716 |
13 | 82c3924a4 |
14 | 479356a66 |
15 | 29420ce7c |
hex | 18ffc4002 |
6710640642 has 64 divisors (see below), whose sum is σ = 15689318400. Its totient is φ = 2123314560.
The previous prime is 6710640631. The next prime is 6710640691. The reversal of 6710640642 is 2460460176.
6710640642 is a `hidden beast` number, since 6 + 7 + 1 + 0 + 6 + 4 + 0 + 642 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 6710640597 and 6710640606.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40959 + ... + 122877.
It is an arithmetic number, because the mean of its divisors is an integer number (245145600).
Almost surely, 26710640642 is an apocalyptic number.
It is a pronic number, being equal to 81918×81919.
It is a practical number, because each smaller number is the sum of distinct divisors of 6710640642, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7844659200).
6710640642 is an abundant number, since it is smaller than the sum of its proper divisors (8978677758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6710640642 is a wasteful number, since it uses less digits than its factorization.
6710640642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82008 (or 82002 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 6710640642 is about 81918.4999984741. The cubic root of 6710640642 is about 1886.2011020133.
The spelling of 6710640642 in words is "six billion, seven hundred ten million, six hundred forty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •