Base | Representation |
---|---|
bin | 11110111101010111001111… |
… | …11011010111000000101000 |
3 | 22221001022010010011112022020 |
4 | 33132223213323113000220 |
5 | 32410402020410123430 |
6 | 400443041153224440 |
7 | 20224361061226014 |
oct | 1736534773270050 |
9 | 287038103145266 |
10 | 68079122739240 |
11 | 1a768214a70428 |
12 | 7776234562120 |
13 | 2bcaaab912c42 |
14 | 12b5093433544 |
15 | 7d0d62e9cb10 |
hex | 3deae7ed7028 |
68079122739240 has 32 divisors (see below), whose sum is σ = 204237368218080. Its totient is φ = 18154432730432.
The previous prime is 68079122739239. The next prime is 68079122739289. The reversal of 68079122739240 is 4293722197086.
It is a hoax number, since the sum of its digits (60) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 283663011294 + ... + 283663011533.
It is an arithmetic number, because the mean of its divisors is an integer number (6382417756815).
Almost surely, 268079122739240 is an apocalyptic number.
68079122739240 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
68079122739240 is an abundant number, since it is smaller than the sum of its proper divisors (136158245478840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68079122739240 is a wasteful number, since it uses less digits than its factorization.
68079122739240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567326022841 (or 567326022837 counting only the distinct ones).
The product of its (nonzero) digits is 18289152, while the sum is 60.
The spelling of 68079122739240 in words is "sixty-eight trillion, seventy-nine billion, one hundred twenty-two million, seven hundred thirty-nine thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •