Base | Representation |
---|---|
bin | 111111111001011001… |
… | …011100010000000000 |
3 | 20120002110101100200000 |
4 | 333321121130100000 |
5 | 2111002312034121 |
6 | 51303550400000 |
7 | 4646121242400 |
oct | 777131342000 |
9 | 216073340600 |
10 | 68608705536 |
11 | 27107909a38 |
12 | 11368b00000 |
13 | 66151264a7 |
14 | 346bd2c800 |
15 | 1bb83da526 |
hex | ff965c400 |
68608705536 has 792 divisors, whose sum is σ = 253807628256. Its totient is φ = 18393661440.
The previous prime is 68608705489. The next prime is 68608705537. The reversal of 68608705536 is 63550780686.
68608705536 is a `hidden beast` number, since 6 + 8 + 6 + 0 + 87 + 0 + 553 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (68608705537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 207276891 + ... + 207277221.
Almost surely, 268608705536 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 68608705536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126903814128).
68608705536 is an abundant number, since it is smaller than the sum of its proper divisors (185198922720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68608705536 is a wasteful number, since it uses less digits than its factorization.
68608705536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397 (or 360 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 54.
The spelling of 68608705536 in words is "sixty-eight billion, six hundred eight million, seven hundred five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •