Base | Representation |
---|---|
bin | 100111000011010… |
… | …000101001100100 |
3 | 1200122210212212100 |
4 | 213003100221210 |
5 | 2320210303202 |
6 | 145002252100 |
7 | 22143551052 |
oct | 4703205144 |
9 | 1618725770 |
10 | 655166052 |
11 | 306907a52 |
12 | 1634b7030 |
13 | a5972528 |
14 | 630271d2 |
15 | 3c7b841c |
hex | 270d0a64 |
655166052 has 36 divisors (see below), whose sum is σ = 1664538876. Its totient is φ = 217277760.
The previous prime is 655166027. The next prime is 655166053. The reversal of 655166052 is 250661556.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 567106596 + 88059456 = 23814^2 + 9384^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 655165998 and 655166016.
It is not an unprimeable number, because it can be changed into a prime (655166053) 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, 39099 + ... + 53282.
It is an arithmetic number, because the mean of its divisors is an integer number (46237191).
Almost surely, 2655166052 is an apocalyptic number.
It is an amenable number.
655166052 is an abundant number, since it is smaller than the sum of its proper divisors (1009372824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
655166052 is a wasteful number, since it uses less digits than its factorization.
655166052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92588 (or 92583 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 655166052 is about 25596.2116728238. The cubic root of 655166052 is about 868.5279426799.
The spelling of 655166052 in words is "six hundred fifty-five million, one hundred sixty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •