Base | Representation |
---|---|
bin | 1000001000001000… |
… | …0100110011011001 |
3 | 12122001000211221212 |
4 | 2002002010303121 |
5 | 13431441111131 |
6 | 1000250512505 |
7 | 105030066332 |
oct | 20202046331 |
9 | 5561024855 |
10 | 2181582041 |
11 | a1a49a971 |
12 | 50a735735 |
13 | 289c83362 |
14 | 169a45289 |
15 | cb7cea2b |
hex | 82084cd9 |
2181582041 has 2 divisors, whose sum is σ = 2181582042. Its totient is φ = 2181582040.
The previous prime is 2181582031. The next prime is 2181582047. The reversal of 2181582041 is 1402851812.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1711559641 + 470022400 = 41371^2 + 21680^2 .
It is a cyclic number.
It is not a de Polignac number, because 2181582041 - 218 = 2181319897 is a prime.
It is a super-2 number, since 2×21815820412 = 9518600403227451362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2181581989 and 2181582007.
It is not a weakly prime, because it can be changed into another prime (2181582047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1090791020 + 1090791021.
It is an arithmetic number, because the mean of its divisors is an integer number (1090791021).
Almost surely, 22181582041 is an apocalyptic number.
It is an amenable number.
2181582041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2181582041 is an equidigital number, since it uses as much as digits as its factorization.
2181582041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5120, while the sum is 32.
The square root of 2181582041 is about 46707.4088448503. The cubic root of 2181582041 is about 1296.9518408980.
The spelling of 2181582041 in words is "two billion, one hundred eighty-one million, five hundred eighty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •