Base | Representation |
---|---|
bin | 100000000010110111… |
… | …1010100010010111000 |
3 | 20120121220000011012110 |
4 | 1000011233110102320 |
5 | 2111413314013322 |
6 | 51340304412320 |
7 | 4654214236320 |
oct | 1000557242270 |
9 | 216556004173 |
10 | 68815766712 |
11 | 27203785080 |
12 | 114063170a0 |
13 | 6648cb37b4 |
14 | 348b62c280 |
15 | 1bcb68bc0c |
hex | 1005bd44b8 |
68815766712 has 128 divisors (see below), whose sum is σ = 214990848000. Its totient is φ = 17832547200.
The previous prime is 68815766699. The next prime is 68815766713. The reversal of 68815766712 is 21766751886.
It is a happy number.
It is a hoax number, since the sum of its digits (57) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68815766713) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 753289 + ... + 839687.
It is an arithmetic number, because the mean of its divisors is an integer number (1679616000).
Almost surely, 268815766712 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 68815766712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107495424000).
68815766712 is an abundant number, since it is smaller than the sum of its proper divisors (146175081288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68815766712 is a wasteful number, since it uses less digits than its factorization.
68815766712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86857 (or 86853 counting only the distinct ones).
The product of its digits is 6773760, while the sum is 57.
The spelling of 68815766712 in words is "sixty-eight billion, eight hundred fifteen million, seven hundred sixty-six thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •