Base | Representation |
---|---|
bin | 111111011111111101… |
… | …010110100111000000 |
3 | 20111222201022000000000 |
4 | 333133331112213000 |
5 | 2104114032141000 |
6 | 51153343000000 |
7 | 4632416455356 |
oct | 773775264700 |
9 | 214881260000 |
10 | 68181912000 |
11 | 26a08a03704 |
12 | 11269b99000 |
13 | 6577893537 |
14 | 342b3917d6 |
15 | 1b90bd3000 |
hex | fdff569c0 |
68181912000 has 560 divisors, whose sum is σ = 253859397792. Its totient is φ = 18139852800.
The previous prime is 68181911999. The next prime is 68181912037. The reversal of 68181912000 is 21918186.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 157463784 + ... + 157464216.
Almost surely, 268181912000 is an apocalyptic number.
68181912000 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68181912000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126929698896).
68181912000 is an abundant number, since it is smaller than the sum of its proper divisors (185677485792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68181912000 is an frugal number, since it uses more digits than its factorization.
68181912000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487 (or 443 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 36.
The spelling of 68181912000 in words is "sixty-eight billion, one hundred eighty-one million, nine hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •