Base | Representation |
---|---|
bin | 1001011011010000… |
… | …1100011111100000 |
3 | 20112100010210010121 |
4 | 2112310030133200 |
5 | 20140221440211 |
6 | 1055024210024 |
7 | 116462620024 |
oct | 22664143740 |
9 | 6470123117 |
10 | 2530265056 |
11 | 10892a5650 |
12 | 5a7469914 |
13 | 314297c77 |
14 | 1a008c384 |
15 | ec208271 |
hex | 96d0c7e0 |
2530265056 has 96 divisors (see below), whose sum is σ = 5558595840. Its totient is φ = 1124121600.
The previous prime is 2530265053. The next prime is 2530265063. The reversal of 2530265056 is 6505620352.
It is a super-2 number, since 2×25302650562 = 12804482507229366272, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2530265053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3423535 + ... + 3424273.
It is an arithmetic number, because the mean of its divisors is an integer number (57902040).
Almost surely, 22530265056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2530265056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2779297920).
2530265056 is an abundant number, since it is smaller than the sum of its proper divisors (3028330784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2530265056 is a wasteful number, since it uses less digits than its factorization.
2530265056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 968 (or 960 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 34.
The square root of 2530265056 is about 50301.7400891858. The cubic root of 2530265056 is about 1362.6636550719.
The spelling of 2530265056 in words is "two billion, five hundred thirty million, two hundred sixty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •