Base | Representation |
---|---|
bin | 100111110001000… |
… | …001000001100000 |
3 | 1201111101021101112 |
4 | 213301001001200 |
5 | 2331243120142 |
6 | 150111322452 |
7 | 22350525563 |
oct | 4761010140 |
9 | 1644337345 |
10 | 667160672 |
11 | 31265a762 |
12 | 167520428 |
13 | a82b1c39 |
14 | 6486a4da |
15 | 3d887382 |
hex | 27c41060 |
667160672 has 48 divisors (see below), whose sum is σ = 1378944000. Its totient is φ = 317320320.
The previous prime is 667160657. The next prime is 667160687. The reversal of 667160672 is 276061766.
It is an interprime number because it is at equal distance from previous prime (667160657) and next prime (667160687).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52829 + ... + 64227.
It is an arithmetic number, because the mean of its divisors is an integer number (28728000).
Almost surely, 2667160672 is an apocalyptic number.
667160672 is a gapful number since it is divisible by the number (62) 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 667160672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (689472000).
667160672 is an abundant number, since it is smaller than the sum of its proper divisors (711783328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
667160672 is a wasteful number, since it uses less digits than its factorization.
667160672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11499 (or 11491 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 41.
The square root of 667160672 is about 25829.4535753275. The cubic root of 667160672 is about 873.7961881651.
The spelling of 667160672 in words is "six hundred sixty-seven million, one hundred sixty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •