Base | Representation |
---|---|
bin | 1001100000101010… |
… | …0010110001010000 |
3 | 20120220201210101100 |
4 | 2120022202301100 |
5 | 20212020310223 |
6 | 1101153304400 |
7 | 120156204102 |
oct | 23012426120 |
9 | 6526653340 |
10 | 2552900688 |
11 | 10a0056088 |
12 | 5b2b65100 |
13 | 318b91c30 |
14 | 1a30a1572 |
15 | ee1ca043 |
hex | 982a2c50 |
2552900688 has 120 divisors (see below), whose sum is σ = 7750302560. Its totient is φ = 779777280.
The previous prime is 2552900687. The next prime is 2552900719. The reversal of 2552900688 is 8860092552.
2552900688 is a `hidden beast` number, since 2 + 552 + 90 + 0 + 6 + 8 + 8 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2552900681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 255303 + ... + 265113.
Almost surely, 22552900688 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 2552900688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3875151280).
2552900688 is an abundant number, since it is smaller than the sum of its proper divisors (5197401872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2552900688 is a wasteful number, since it uses less digits than its factorization.
2552900688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9977 (or 9968 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 45.
The square root of 2552900688 is about 50526.2376196764. The cubic root of 2552900688 is about 1366.7150394406.
The spelling of 2552900688 in words is "two billion, five hundred fifty-two million, nine hundred thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •