Base | Representation |
---|---|
bin | 100111011110001… |
… | …101100001110000 |
3 | 1201011002211100201 |
4 | 213132031201300 |
5 | 2324012344102 |
6 | 145413524544 |
7 | 22260605032 |
oct | 4736154160 |
9 | 1634084321 |
10 | 662231152 |
11 | 30a8a3080 |
12 | 165943754 |
13 | a727726b |
14 | 63d45c52 |
15 | 3d211987 |
hex | 2778d870 |
662231152 has 40 divisors (see below), whose sum is σ = 1408159872. Its totient is φ = 299198400.
The previous prime is 662231137. The next prime is 662231159. The reversal of 662231152 is 251132266.
662231152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 662231152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (662231159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18127 + ... + 40657.
Almost surely, 2662231152 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 662231152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (704079936).
662231152 is an abundant number, since it is smaller than the sum of its proper divisors (745928720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
662231152 is a wasteful number, since it uses less digits than its factorization.
662231152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22717 (or 22711 counting only the distinct ones).
The product of its digits is 4320, while the sum is 28.
The square root of 662231152 is about 25733.8522572894. The cubic root of 662231152 is about 871.6387626423.
The spelling of 662231152 in words is "six hundred sixty-two million, two hundred thirty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •