Base | Representation |
---|---|
bin | 1001100001111100… |
… | …0011000001010100 |
3 | 20121021211212110200 |
4 | 2120133003001110 |
5 | 20214404310133 |
6 | 1101504420500 |
7 | 120252661434 |
oct | 23037030124 |
9 | 6537755420 |
10 | 2558275668 |
11 | 10a3097413 |
12 | 5b4917730 |
13 | 31a0245b0 |
14 | 1a3aa02c4 |
15 | ee8dc913 |
hex | 987c3054 |
2558275668 has 72 divisors (see below), whose sum is σ = 7373876328. Its totient is φ = 740855808.
The previous prime is 2558275667. The next prime is 2558275739. The reversal of 2558275668 is 8665728552.
2558275668 is a `hidden beast` number, since 2 + 5 + 58 + 27 + 566 + 8 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 1121714064 + 1436561604 = 33492^2 + 37902^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2558275661) 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 23 ways as a sum of consecutive naturals, for example, 152821 + ... + 168732.
It is an arithmetic number, because the mean of its divisors is an integer number (102414949).
Almost surely, 22558275668 is an apocalyptic number.
It is an amenable number.
2558275668 is an abundant number, since it is smaller than the sum of its proper divisors (4815600660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2558275668 is a wasteful number, since it uses less digits than its factorization.
2558275668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321593 (or 321588 counting only the distinct ones).
The product of its digits is 8064000, while the sum is 54.
The square root of 2558275668 is about 50579.3996405651. The cubic root of 2558275668 is about 1367.6735460381.
The spelling of 2558275668 in words is "two billion, five hundred fifty-eight million, two hundred seventy-five thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •