Base | Representation |
---|---|
bin | 1001100011010110… |
… | …1110110111101001 |
3 | 20121201000222220112 |
4 | 2120311232313221 |
5 | 20222420104231 |
6 | 1102240104105 |
7 | 120354350114 |
oct | 23065566751 |
9 | 6551028815 |
10 | 2564222441 |
11 | 10a6489300 |
12 | 5b6905035 |
13 | 31b3272b1 |
14 | 1a47ab57b |
15 | 1001b492b |
hex | 98d6ede9 |
2564222441 has 12 divisors (see below), whose sum is σ = 2846445252. Its totient is φ = 2308020000.
The previous prime is 2564222417. The next prime is 2564222447. The reversal of 2564222441 is 1442224652.
It can be written as a sum of positive squares in 2 ways, for example, as 1780502416 + 783720025 = 42196^2 + 27995^2 .
It is not a de Polignac number, because 2564222441 - 210 = 2564221417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2564222398 and 2564222407.
It is not an unprimeable number, because it can be changed into a prime (2564222447) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 92690 + ... + 117131.
It is an arithmetic number, because the mean of its divisors is an integer number (237203771).
Almost surely, 22564222441 is an apocalyptic number.
It is an amenable number.
2564222441 is a deficient number, since it is larger than the sum of its proper divisors (282222811).
2564222441 is a wasteful number, since it uses less digits than its factorization.
2564222441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209944 (or 209933 counting only the distinct ones).
The product of its digits is 30720, while the sum is 32.
The square root of 2564222441 is about 50638.1520298678. The cubic root of 2564222441 is about 1368.7324559346.
The spelling of 2564222441 in words is "two billion, five hundred sixty-four million, two hundred twenty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •