Base | Representation |
---|---|
bin | 1001011010111001… |
… | …1111001111001010 |
3 | 20112020022202220000 |
4 | 2112232133033022 |
5 | 20134331101340 |
6 | 1054532143430 |
7 | 116444116200 |
oct | 22656371712 |
9 | 6466282800 |
10 | 2528768970 |
11 | 1088473612 |
12 | 5a6a67b76 |
13 | 313b93000 |
14 | 19dbbd070 |
15 | ec00ed30 |
hex | 96b9f3ca |
2528768970 has 480 divisors, whose sum is σ = 8864024400. Its totient is φ = 515144448.
The previous prime is 2528768953. The next prime is 2528769043. The reversal of 2528768970 is 798678252.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 157176369 + 2371592601 = 12537^2 + 48699^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 87198916 + ... + 87198944.
Almost surely, 22528768970 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2528768970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4432012200).
2528768970 is an abundant number, since it is smaller than the sum of its proper divisors (6335255430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2528768970 is a wasteful number, since it uses less digits than its factorization.
2528768970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 3386880, while the sum is 54.
The square root of 2528768970 is about 50286.8667745367. The cubic root of 2528768970 is about 1362.3950318371.
The spelling of 2528768970 in words is "two billion, five hundred twenty-eight million, seven hundred sixty-eight thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •