Base | Representation |
---|---|
bin | 111110000001100… |
… | …0011101010110001 |
3 | 12101001002201002112 |
4 | 1330003003222301 |
5 | 13230240114431 |
6 | 542302455105 |
7 | 102400464134 |
oct | 17403035261 |
9 | 5331081075 |
10 | 2081176241 |
11 | 978851571 |
12 | 4a0b94495 |
13 | 272229c41 |
14 | 15a58a21b |
15 | c2a99c2b |
hex | 7c0c3ab1 |
2081176241 has 2 divisors, whose sum is σ = 2081176242. Its totient is φ = 2081176240.
The previous prime is 2081176231. The next prime is 2081176243. The reversal of 2081176241 is 1426711802.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1888771600 + 192404641 = 43460^2 + 13871^2 .
It is a cyclic number.
It is not a de Polignac number, because 2081176241 - 222 = 2076981937 is a prime.
It is a super-2 number, since 2×20811762412 = 8662589092205780162, which contains 22 as substring.
Together with 2081176243, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2081176198 and 2081176207.
It is not a weakly prime, because it can be changed into another prime (2081176243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1040588120 + 1040588121.
It is an arithmetic number, because the mean of its divisors is an integer number (1040588121).
Almost surely, 22081176241 is an apocalyptic number.
It is an amenable number.
2081176241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2081176241 is an equidigital number, since it uses as much as digits as its factorization.
2081176241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 32.
The square root of 2081176241 is about 45619.9105764139. The cubic root of 2081176241 is about 1276.7414350458.
The spelling of 2081176241 in words is "two billion, eighty-one million, one hundred seventy-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •