Base | Representation |
---|---|
bin | 1001011010111000… |
… | …0110000100000000 |
3 | 20112020010112102222 |
4 | 2112232012010000 |
5 | 20134314301411 |
6 | 1054530030212 |
7 | 116443206443 |
oct | 22656060400 |
9 | 6466115388 |
10 | 2528665856 |
11 | 10884030a2 |
12 | 5a6a18368 |
13 | 313b580b2 |
14 | 19db9365a |
15 | ebede4db |
hex | 96b86100 |
2528665856 has 36 divisors (see below), whose sum is σ = 5056269372. Its totient is φ = 1262125056.
The previous prime is 2528665807. The next prime is 2528665873. The reversal of 2528665856 is 6585668252.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 2205241600 + 323424256 = 46960^2 + 17984^2 .
It is a super-3 number, since 3×25286658563 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2528665798 and 2528665807.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 143480 + ... + 160136.
It is an arithmetic number, because the mean of its divisors is an integer number (140451927).
Almost surely, 22528665856 is an apocalyptic number.
It is an amenable number.
2528665856 is a deficient number, since it is larger than the sum of its proper divisors (2527603516).
2528665856 is an equidigital number, since it uses as much as digits as its factorization.
2528665856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17266 (or 17252 counting only the distinct ones).
The product of its digits is 6912000, while the sum is 53.
The square root of 2528665856 is about 50285.8415063326. The cubic root of 2528665856 is about 1362.3765137475.
The spelling of 2528665856 in words is "two billion, five hundred twenty-eight million, six hundred sixty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •