Base | Representation |
---|---|
bin | 110010010001001011000… |
… | …1011101011101010000000 |
3 | 220110110220000222120122000 |
4 | 1210202112023223222000 |
5 | 1401143234211304033 |
6 | 22405512112544000 |
7 | 1312101114015120 |
oct | 144422613535200 |
9 | 26413800876560 |
10 | 6908827056768 |
11 | 222402084068a |
12 | 936b88252000 |
13 | 3b16657c6300 |
14 | 19c56364cc80 |
15 | beaab3cda13 |
hex | 648962eba80 |
6908827056768 has 2304 divisors, whose sum is σ = 27673226035200. Its totient is φ = 1659460608000.
The previous prime is 6908827056757. The next prime is 6908827056773. The reversal of 6908827056768 is 8676507288096.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 6908827056696 and 6908827056705.
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 45753821493 + ... + 45753821643.
It is an arithmetic number, because the mean of its divisors is an integer number (12010948800).
Almost surely, 26908827056768 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 6908827056768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13836613017600).
6908827056768 is an abundant number, since it is smaller than the sum of its proper divisors (20764398978432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6908827056768 is a wasteful number, since it uses less digits than its factorization.
6908827056768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276 (or 226 counting only the distinct ones).
The product of its (nonzero) digits is 487710720, while the sum is 72.
The spelling of 6908827056768 in words is "six trillion, nine hundred eight billion, eight hundred twenty-seven million, fifty-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •