Base | Representation |
---|---|
bin | 1000000001011… |
… | …00011011011000 |
3 | 11200121201200100 |
4 | 10000230123120 |
5 | 114211301330 |
6 | 10402135400 |
7 | 1444651131 |
oct | 400543330 |
9 | 150551610 |
10 | 67290840 |
11 | 34a90671 |
12 | 1a651560 |
13 | 10c30686 |
14 | 8d18c88 |
15 | 5d93060 |
hex | 402c6d8 |
67290840 has 192 divisors, whose sum is σ = 231154560. Its totient is φ = 16957440.
The previous prime is 67290833. The next prime is 67290851. The reversal of 67290840 is 4809276.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 67290795 and 67290804.
It is a congruent number.
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, 693672 + ... + 693768.
It is an arithmetic number, because the mean of its divisors is an integer number (1203930).
Almost surely, 267290840 is an apocalyptic number.
67290840 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 67290840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115577280).
67290840 is an abundant number, since it is smaller than the sum of its proper divisors (163863720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67290840 is a wasteful number, since it uses less digits than its factorization.
67290840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202 (or 195 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 67290840 is about 8203.0994142458. The cubic root of 67290840 is about 406.7416535852.
The spelling of 67290840 in words is "sixty-seven million, two hundred ninety thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •