Base | Representation |
---|---|
bin | 1001100011111000… |
… | …0111100001010001 |
3 | 20121212011200011101 |
4 | 2120332013201101 |
5 | 20224000424221 |
6 | 1102355144401 |
7 | 120412133455 |
oct | 23076074121 |
9 | 6555150141 |
10 | 2566420561 |
11 | 10a774a831 |
12 | 5b75a5101 |
13 | 31b916963 |
14 | 1a4bc0665 |
15 | 10049ad91 |
hex | 98f87851 |
2566420561 has 4 divisors (see below), whose sum is σ = 2567911792. Its totient is φ = 2564929332.
The previous prime is 2566420559. The next prime is 2566420567. The reversal of 2566420561 is 1650246652.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2566420561 - 21 = 2566420559 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2566420561.
It is not an unprimeable number, because it can be changed into a prime (2566420567) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 743031 + ... + 746476.
It is an arithmetic number, because the mean of its divisors is an integer number (641977948).
Almost surely, 22566420561 is an apocalyptic number.
It is an amenable number.
2566420561 is a deficient number, since it is larger than the sum of its proper divisors (1491231).
2566420561 is a wasteful number, since it uses less digits than its factorization.
2566420561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1491230.
The product of its (nonzero) digits is 86400, while the sum is 37.
The square root of 2566420561 is about 50659.8515690680. The cubic root of 2566420561 is about 1369.1234489120.
It can be divided in two parts, 25664 and 20561, that added together give a square (46225 = 2152).
The spelling of 2566420561 in words is "two billion, five hundred sixty-six million, four hundred twenty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •