Base | Representation |
---|---|
bin | 1001100000101100… |
… | …0001101111100110 |
3 | 20120220222020102020 |
4 | 2120023001233212 |
5 | 20212033340213 |
6 | 1101200124010 |
7 | 120160243014 |
oct | 23013015746 |
9 | 6526866366 |
10 | 2553027558 |
11 | 10a0132434 |
12 | 5b3006606 |
13 | 318c078c3 |
14 | 1a30d58b4 |
15 | ee202923 |
hex | 982c1be6 |
2553027558 has 8 divisors (see below), whose sum is σ = 5106055128. Its totient is φ = 851009184.
The previous prime is 2553027553. The next prime is 2553027569. The reversal of 2553027558 is 8557203552.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
2553027558 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2553027551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212752291 + ... + 212752302.
It is an arithmetic number, because the mean of its divisors is an integer number (638256891).
Almost surely, 22553027558 is an apocalyptic number.
2553027558 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2553027558 is a wasteful number, since it uses less digits than its factorization.
2553027558 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425504598.
The product of its (nonzero) digits is 420000, while the sum is 42.
The square root of 2553027558 is about 50527.4930903958. The cubic root of 2553027558 is about 1366.7376793427.
The spelling of 2553027558 in words is "two billion, five hundred fifty-three million, twenty-seven thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •