Base | Representation |
---|---|
bin | 111110011110011001… |
… | …100000101000000000 |
3 | 20102011001121112000000 |
4 | 332132121200220000 |
5 | 2044340442344200 |
6 | 50452252000000 |
7 | 4563232364460 |
oct | 763631405000 |
9 | 212131545000 |
10 | 67081996800 |
11 | 264a4047085 |
12 | 11001760000 |
13 | 6430a42340 |
14 | 3365275ba0 |
15 | 1b29367300 |
hex | f9e660a00 |
67081996800 has 1680 divisors, whose sum is σ = 310574288640. Its totient is φ = 13974405120.
The previous prime is 67081996777. The next prime is 67081996843. The reversal of 67081996800 is 869918076.
It is a tau number, because it is divible by the number of its divisors (1680).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 849139161 + ... + 849139239.
It is an arithmetic number, because the mean of its divisors is an integer number (184865648).
Almost surely, 267081996800 is an apocalyptic number.
67081996800 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 67081996800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155287144320).
67081996800 is an abundant number, since it is smaller than the sum of its proper divisors (243492291840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67081996800 is an equidigital number, since it uses as much as digits as its factorization.
67081996800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 54.
The spelling of 67081996800 in words is "sixty-seven billion, eighty-one million, nine hundred ninety-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •