Base | Representation |
---|---|
bin | 1000000111110100… |
… | …0010000011011001 |
3 | 12121221112200112111 |
4 | 2001331002003121 |
5 | 13431121310212 |
6 | 1000202312321 |
7 | 105012622213 |
oct | 20175020331 |
9 | 5557480474 |
10 | 2180260057 |
11 | a19777718 |
12 | 50a1b86a1 |
13 | 28990c711 |
14 | 1697bd5b3 |
15 | cb61cea7 |
hex | 81f420d9 |
2180260057 has 2 divisors, whose sum is σ = 2180260058. Its totient is φ = 2180260056.
The previous prime is 2180260001. The next prime is 2180260063. The reversal of 2180260057 is 7500620812.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1843757721 + 336502336 = 42939^2 + 18344^2 .
It is a cyclic number.
It is not a de Polignac number, because 2180260057 - 27 = 2180259929 is a prime.
It is a super-2 number, since 2×21802600572 = 9507067832299286498, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2180260457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1090130028 + 1090130029.
It is an arithmetic number, because the mean of its divisors is an integer number (1090130029).
Almost surely, 22180260057 is an apocalyptic number.
It is an amenable number.
2180260057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2180260057 is an equidigital number, since it uses as much as digits as its factorization.
2180260057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 2180260057 is about 46693.2549411583. The cubic root of 2180260057 is about 1296.6898145350.
Adding to 2180260057 its reverse (7500620812), we get a palindrome (9680880869).
The spelling of 2180260057 in words is "two billion, one hundred eighty million, two hundred sixty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •