Base | Representation |
---|---|
bin | 11111001100100110010110… |
… | …00111011110111100000000 |
3 | 22222220100100220202112000000 |
4 | 33212103023013132330000 |
5 | 32442441134044411123 |
6 | 401523335552000000 |
7 | 20310243003304155 |
oct | 1746231307367400 |
9 | 288810326675000 |
10 | 68602625388288 |
11 | 1a94a234623a22 |
12 | 783b794530000 |
13 | 2c38279cc1934 |
14 | 12d2555bca22c |
15 | 7de7a20cdb43 |
hex | 3e64cb1def00 |
68602625388288 has 504 divisors, whose sum is σ = 212490137904576. Its totient is φ = 22079560089600.
The previous prime is 68602625388277. The next prime is 68602625388371. The reversal of 68602625388288 is 88288352620686.
68602625388288 is a `hidden beast` number, since 6 + 8 + 6 + 0 + 2 + 6 + 2 + 538 + 8 + 2 + 88 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 742157433 + ... + 742249863.
Almost surely, 268602625388288 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 68602625388288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106245068952288).
68602625388288 is an abundant number, since it is smaller than the sum of its proper divisors (143887512516288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68602625388288 is an frugal number, since it uses more digits than its factorization.
68602625388288 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92603 (or 92574 counting only the distinct ones).
The product of its (nonzero) digits is 849346560, while the sum is 72.
The spelling of 68602625388288 in words is "sixty-eight trillion, six hundred two billion, six hundred twenty-five million, three hundred eighty-eight thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •