Base | Representation |
---|---|
bin | 100111110000111… |
… | …100100101100000 |
3 | 1201111100100110100 |
4 | 213300330211200 |
5 | 2331242024441 |
6 | 150111102400 |
7 | 22350421566 |
oct | 4760744540 |
9 | 1644310410 |
10 | 667142496 |
11 | 312648039 |
12 | 167511a00 |
13 | a82a6897 |
14 | 64863a36 |
15 | 3d881cb6 |
hex | 27c3c960 |
667142496 has 72 divisors (see below), whose sum is σ = 1899929304. Its totient is φ = 222059520.
The previous prime is 667142491. The next prime is 667142501. The reversal of 667142496 is 694241766.
It is an interprime number because it is at equal distance from previous prime (667142491) and next prime (667142501).
It is a tau number, because it is divible by the number of its divisors (72).
It is a super-4 number, since 4×6671424964 (a number of 36 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (667142491) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 280191 + ... + 282561.
It is an arithmetic number, because the mean of its divisors is an integer number (26387907).
Almost surely, 2667142496 is an apocalyptic number.
It is an amenable number.
667142496 is an abundant number, since it is smaller than the sum of its proper divisors (1232786808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
667142496 is a wasteful number, since it uses less digits than its factorization.
667142496 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3364 (or 3353 counting only the distinct ones).
The product of its digits is 435456, while the sum is 45.
The square root of 667142496 is about 25829.1017265409. The cubic root of 667142496 is about 873.7882529134.
The spelling of 667142496 in words is "six hundred sixty-seven million, one hundred forty-two thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •