Base | Representation |
---|---|
bin | 111111010000101101… |
… | …110110100000000000 |
3 | 20111022220002222110210 |
4 | 333100231312200000 |
5 | 2103103101040310 |
6 | 51112125554120 |
7 | 4623163042410 |
oct | 772055664000 |
9 | 214286088423 |
10 | 67926190080 |
11 | 26897621a81 |
12 | 111b8415940 |
13 | 65368c95a8 |
14 | 3405426640 |
15 | 1b7851d820 |
hex | fd0b76800 |
67926190080 has 576 divisors, whose sum is σ = 264064993920. Its totient is φ = 14599323648.
The previous prime is 67926190069. The next prime is 67926190109. The reversal of 67926190080 is 8009162976.
It is a super-2 number, since 2×679261900802 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 62146014 + ... + 62147106.
It is an arithmetic number, because the mean of its divisors is an integer number (458446170).
Almost surely, 267926190080 is an apocalyptic number.
67926190080 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 67926190080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132032496960).
67926190080 is an abundant number, since it is smaller than the sum of its proper divisors (196138803840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67926190080 is a wasteful number, since it uses less digits than its factorization.
67926190080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1164 (or 1127 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 67926190080 in words is "sixty-seven billion, nine hundred twenty-six million, one hundred ninety thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •