Base | Representation |
---|---|
bin | 1001100010101001… |
… | …0101010010001100 |
3 | 20121111102011121202 |
4 | 2120222111102030 |
5 | 20221133442220 |
6 | 1102052045032 |
7 | 120320062460 |
oct | 23052252214 |
9 | 6544364552 |
10 | 2561234060 |
11 | 10a4828070 |
12 | 5b5903778 |
13 | 31a81c018 |
14 | 1a42304a0 |
15 | eecc4275 |
hex | 98a9548c |
2561234060 has 96 divisors (see below), whose sum is σ = 6716183040. Its totient is φ = 797068800.
The previous prime is 2561234057. The next prime is 2561234083. The reversal of 2561234060 is 604321652.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1938200 + ... + 1939520.
It is an arithmetic number, because the mean of its divisors is an integer number (69960240).
Almost surely, 22561234060 is an apocalyptic number.
2561234060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2561234060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3358091520).
2561234060 is an abundant number, since it is smaller than the sum of its proper divisors (4154948980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2561234060 is a wasteful number, since it uses less digits than its factorization.
2561234060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2607 (or 2605 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 2561234060 is about 50608.6362195228. The cubic root of 2561234060 is about 1368.2005358755.
The spelling of 2561234060 in words is "two billion, five hundred sixty-one million, two hundred thirty-four thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •