Base | Representation |
---|---|
bin | 111101010010100… |
… | …0101111101010001 |
3 | 12022022202021010022 |
4 | 1322211011331101 |
5 | 13202433402311 |
6 | 540022513225 |
7 | 101651223224 |
oct | 17245057521 |
9 | 5268667108 |
10 | 2056544081 |
11 | 965958009 |
12 | 494895815 |
13 | 26a0b42b7 |
14 | 1571b75bb |
15 | c08315db |
hex | 7a945f51 |
2056544081 has 2 divisors, whose sum is σ = 2056544082. Its totient is φ = 2056544080.
The previous prime is 2056544071. The next prime is 2056544129. The reversal of 2056544081 is 1804456502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1547635600 + 508908481 = 39340^2 + 22559^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2056544081 is a prime.
It is a super-2 number, since 2×20565440812 = 8458747114192269122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2056544071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1028272040 + 1028272041.
It is an arithmetic number, because the mean of its divisors is an integer number (1028272041).
Almost surely, 22056544081 is an apocalyptic number.
It is an amenable number.
2056544081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2056544081 is an equidigital number, since it uses as much as digits as its factorization.
2056544081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 35.
The square root of 2056544081 is about 45349.1353941836. The cubic root of 2056544081 is about 1271.6843917956.
It can be divided in two parts, 20565 and 44081, that added together give a palindrome (64646).
The spelling of 2056544081 in words is "two billion, fifty-six million, five hundred forty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •