Base | Representation |
---|---|
bin | 1001100010010110… |
… | …1110101100001001 |
3 | 20121102010212101200 |
4 | 2120211232230021 |
5 | 20220331334101 |
6 | 1102010134413 |
7 | 120303605511 |
oct | 23045565411 |
9 | 6542125350 |
10 | 2560027401 |
11 | 10a4083528 |
12 | 5b5421409 |
13 | 31a4b8a19 |
14 | 1a3dd8841 |
15 | eeb36986 |
hex | 9896eb09 |
2560027401 has 12 divisors (see below), whose sum is σ = 3703818612. Its totient is φ = 1703915136.
The previous prime is 2560027387. The next prime is 2560027409. The reversal of 2560027401 is 1047200652.
2560027401 is a `hidden beast` number, since 256 + 0 + 0 + 2 + 7 + 401 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1060479225 + 1499548176 = 32565^2 + 38724^2 .
It is a de Polignac number, because none of the positive numbers 2k-2560027401 is a prime.
It is a super-3 number, since 3×25600274013 (a number of 29 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2560027409) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 224956 + ... + 236061.
It is an arithmetic number, because the mean of its divisors is an integer number (308651551).
Almost surely, 22560027401 is an apocalyptic number.
It is an amenable number.
2560027401 is a deficient number, since it is larger than the sum of its proper divisors (1143791211).
2560027401 is a wasteful number, since it uses less digits than its factorization.
2560027401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461640 (or 461637 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 2560027401 is about 50596.7133418763. The cubic root of 2560027401 is about 1367.9856380584.
The spelling of 2560027401 in words is "two billion, five hundred sixty million, twenty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •