Base | Representation |
---|---|
bin | 1001100101010111… |
… | …1010111011011001 |
3 | 20122021220200200001 |
4 | 2121111322323121 |
5 | 20232100113231 |
6 | 1103141013001 |
7 | 120516152521 |
oct | 23125727331 |
9 | 6567820601 |
10 | 2572660441 |
11 | 110022195a |
12 | 5b96b4161 |
13 | 31ccbcbb0 |
14 | 1a5966681 |
15 | 100cceb61 |
hex | 9957aed9 |
2572660441 has 16 divisors (see below), whose sum is σ = 2873480400. Its totient is φ = 2286966528.
The previous prime is 2572660427. The next prime is 2572660487. The reversal of 2572660441 is 1440662752.
It can be written as a sum of positive squares in 8 ways, for example, as 70560000 + 2502100441 = 8400^2 + 50021^2 .
It is a cyclic number.
It is not a de Polignac number, because 2572660441 - 27 = 2572660313 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 2572660441.
It is not an unprimeable number, because it can be changed into a prime (2572660141) 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 15 ways as a sum of consecutive naturals, for example, 141075 + ... + 158263.
It is an arithmetic number, because the mean of its divisors is an integer number (179592525).
Almost surely, 22572660441 is an apocalyptic number.
It is an amenable number.
2572660441 is a deficient number, since it is larger than the sum of its proper divisors (300819959).
2572660441 is a wasteful number, since it uses less digits than its factorization.
2572660441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17628.
The product of its (nonzero) digits is 80640, while the sum is 37.
The square root of 2572660441 is about 50721.4002271231. The cubic root of 2572660441 is about 1370.2321593171.
The spelling of 2572660441 in words is "two billion, five hundred seventy-two million, six hundred sixty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •