Base | Representation |
---|---|
bin | 1000000000101… |
… | …10100000111000 |
3 | 11200110011112220 |
4 | 10000112200320 |
5 | 114200413310 |
6 | 10400204040 |
7 | 1444125342 |
oct | 400264070 |
9 | 150404486 |
10 | 67201080 |
11 | 34a2a191 |
12 | 1a609620 |
13 | 10bcb86b |
14 | 8cd4292 |
15 | 5d76670 |
hex | 4016838 |
67201080 has 64 divisors (see below), whose sum is σ = 202573440. Its totient is φ = 17834112.
The previous prime is 67201063. The next prime is 67201093. The reversal of 67201080 is 8010276.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 67201080.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26007 + ... + 28473.
It is an arithmetic number, because the mean of its divisors is an integer number (3165210).
Almost surely, 267201080 is an apocalyptic number.
67201080 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 67201080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101286720).
67201080 is an abundant number, since it is smaller than the sum of its proper divisors (135372360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67201080 is a wasteful number, since it uses less digits than its factorization.
67201080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2708 (or 2704 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 24.
The square root of 67201080 is about 8197.6264857579. The cubic root of 67201080 is about 406.5607207065.
The spelling of 67201080 in words is "sixty-seven million, two hundred one thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •