Base | Representation |
---|---|
bin | 11110111101010101000010… |
… | …11100001011110000000000 |
3 | 22221001012001200221100200000 |
4 | 33132222201130023300000 |
5 | 32410342110140132121 |
6 | 400442323550400000 |
7 | 20224316551412424 |
oct | 1736524134136000 |
9 | 287035050840600 |
10 | 68077940161536 |
11 | 1a767768484288 |
12 | 7775b64500000 |
13 | 2bca95090b816 |
14 | 12b4dc035ab84 |
15 | 7d0ce4254526 |
hex | 3deaa170bc00 |
68077940161536 has 792 divisors, whose sum is σ = 217927861547760. Its totient is φ = 21201203036160.
The previous prime is 68077940161531. The next prime is 68077940161537. The reversal of 68077940161536 is 63516104977086.
68077940161536 is a `hidden beast` number, since 6 + 8 + 0 + 7 + 7 + 9 + 4 + 0 + 1 + 615 + 3 + 6 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68077940161531) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 6934694100 + ... + 6934703916.
Almost surely, 268077940161536 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 68077940161536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108963930773880).
68077940161536 is an abundant number, since it is smaller than the sum of its proper divisors (149849921386224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68077940161536 is an equidigital number, since it uses as much as digits as its factorization.
68077940161536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9943 (or 9882 counting only the distinct ones).
The product of its (nonzero) digits is 45722880, while the sum is 63.
The spelling of 68077940161536 in words is "sixty-eight trillion, seventy-seven billion, nine hundred forty million, one hundred sixty-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •