Base | Representation |
---|---|
bin | 1001100011110111… |
… | …1101111111100100 |
3 | 20121212002200122011 |
4 | 2120331331333210 |
5 | 20223443202130 |
6 | 1102354244004 |
7 | 120411611632 |
oct | 23075757744 |
9 | 6555080564 |
10 | 2566381540 |
11 | 10a7723488 |
12 | 5b7586604 |
13 | 31b901c78 |
14 | 1a4bb0352 |
15 | 10048e52a |
hex | 98f7dfe4 |
2566381540 has 24 divisors (see below), whose sum is σ = 5706425592. Its totient is φ = 966167040.
The previous prime is 2566381537. The next prime is 2566381541. The reversal of 2566381540 is 451836652.
It can be written as a sum of positive squares in 4 ways, for example, as 981067684 + 1585313856 = 31322^2 + 39816^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2566381493 and 2566381502.
It is not an unprimeable number, because it can be changed into a prime (2566381541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3773751 + ... + 3774430.
It is an arithmetic number, because the mean of its divisors is an integer number (237767733).
Almost surely, 22566381540 is an apocalyptic number.
2566381540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2566381540 is an abundant number, since it is smaller than the sum of its proper divisors (3140044052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2566381540 is a wasteful number, since it uses less digits than its factorization.
2566381540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7548207 (or 7548205 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 40.
The square root of 2566381540 is about 50659.4664401432. The cubic root of 2566381540 is about 1369.1165099561.
The spelling of 2566381540 in words is "two billion, five hundred sixty-six million, three hundred eighty-one thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •