Base | Representation |
---|---|
bin | 11110111101011001000001… |
… | …11110110111100011000000 |
3 | 22221001101120211100101200110 |
4 | 33132230200332313203000 |
5 | 32410411000432212011 |
6 | 400443320145551320 |
7 | 20224423563405600 |
oct | 1736544076674300 |
9 | 287041524311613 |
10 | 68080079960256 |
11 | 1a768666325781 |
12 | 7776461045540 |
13 | 2bcac02022700 |
14 | 12b5144606c00 |
15 | 7d0dbc02dba6 |
hex | 3deb20fb78c0 |
68080079960256 has 2016 divisors, whose sum is σ = 240317550563328. Its totient is φ = 16933873582080.
The previous prime is 68080079960239. The next prime is 68080079960273. The reversal of 68080079960256 is 65206997008086.
It is an interprime number because it is at equal distance from previous prime (68080079960239) and next prime (68080079960273).
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, 356440209121 + ... + 356440209311.
It is an arithmetic number, because the mean of its divisors is an integer number (119205134208).
Almost surely, 268080079960256 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 68080079960256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120158775281664).
68080079960256 is an abundant number, since it is smaller than the sum of its proper divisors (172237470603072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68080079960256 is a wasteful number, since it uses less digits than its factorization.
68080079960256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439 (or 409 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 66.
The spelling of 68080079960256 in words is "sixty-eight trillion, eighty billion, seventy-nine million, nine hundred sixty thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •