Base | Representation |
---|---|
bin | 1001100000011110… |
… | …0100110011001000 |
3 | 20120212021021000002 |
4 | 2120013210303020 |
5 | 20211320410233 |
6 | 1101124502132 |
7 | 120146453402 |
oct | 23007446310 |
9 | 6525237002 |
10 | 2552122568 |
11 | 109a674506 |
12 | 5b284a948 |
13 | 31897b9c8 |
14 | 1a2d3bb72 |
15 | ee0c46e8 |
hex | 981e4cc8 |
2552122568 has 36 divisors (see below), whose sum is σ = 4891736115. Its totient is φ = 1248269568.
The previous prime is 2552122561. The next prime is 2552122631. The reversal of 2552122568 is 8652212552.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 1249056964 + 1303065604 = 35342^2 + 36098^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=35722.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2552122561) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 7572896 + ... + 7573232.
Almost surely, 22552122568 is an apocalyptic number.
It is an amenable number.
2552122568 is a deficient number, since it is larger than the sum of its proper divisors (2339613547).
2552122568 is an frugal number, since it uses more digits than its factorization.
2552122568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786 (or 392 counting only the distinct ones).
The product of its digits is 96000, while the sum is 38.
The square root of 2552122568 is about 50518.5368750917. The cubic root of 2552122568 is about 1366.5761678193.
The spelling of 2552122568 in words is "two billion, five hundred fifty-two million, one hundred twenty-two thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •