Base | Representation |
---|---|
bin | 1111111110011… |
… | …1000100010100 |
3 | 11200002021222010 |
4 | 3333213010110 |
5 | 114123203430 |
6 | 10352104220 |
7 | 1442355633 |
oct | 377470424 |
9 | 150067863 |
10 | 67006740 |
11 | 34907179 |
12 | 1a535070 |
13 | 10b61278 |
14 | 8c8351a |
15 | 5d38cb0 |
hex | 3fe7114 |
67006740 has 48 divisors (see below), whose sum is σ = 189298368. Its totient is φ = 17708544.
The previous prime is 67006739. The next prime is 67006777. The reversal of 67006740 is 4760076.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 67006698 and 67006707.
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, 1839 + ... + 11721.
It is an arithmetic number, because the mean of its divisors is an integer number (3943716).
Almost surely, 267006740 is an apocalyptic number.
67006740 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 67006740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94649184).
67006740 is an abundant number, since it is smaller than the sum of its proper divisors (122291628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67006740 is a wasteful number, since it uses less digits than its factorization.
67006740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10008 (or 10006 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 30.
The square root of 67006740 is about 8185.7644725462. The cubic root of 67006740 is about 406.1684289084.
The spelling of 67006740 in words is "sixty-seven million, six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •