Base | Representation |
---|---|
bin | 100111110100001… |
… | …011100010001000 |
3 | 1201112221102020000 |
4 | 213310023202020 |
5 | 2332001141102 |
6 | 150141203000 |
7 | 22360552104 |
oct | 4764134210 |
9 | 1645842200 |
10 | 667990152 |
11 | 313076985 |
12 | 167860460 |
13 | a851265b |
14 | 64a04904 |
15 | 3d99d01c |
hex | 27d0b888 |
667990152 has 80 divisors (see below), whose sum is σ = 1897473600. Its totient is φ = 219512160.
The previous prime is 667990117. The next prime is 667990207. The reversal of 667990152 is 251099766.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 667990098 and 667990107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 38749 + ... + 53267.
It is an arithmetic number, because the mean of its divisors is an integer number (23718420).
Almost surely, 2667990152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 667990152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (948736800).
667990152 is an abundant number, since it is smaller than the sum of its proper divisors (1229483448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
667990152 is a wasteful number, since it uses less digits than its factorization.
667990152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14608 (or 14595 counting only the distinct ones).
The product of its (nonzero) digits is 204120, while the sum is 45.
The square root of 667990152 is about 25845.5054506581. The cubic root of 667990152 is about 874.1581680801.
The spelling of 667990152 in words is "six hundred sixty-seven million, nine hundred ninety thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •