Base | Representation |
---|---|
bin | 1000100111000100… |
… | …0100111000011001 |
3 | 12222002012102102001 |
4 | 2021301010320121 |
5 | 14213200444031 |
6 | 1021204041001 |
7 | 111164045125 |
oct | 21161047031 |
9 | 5862172361 |
10 | 2311343641 |
11 | a86769762 |
12 | 546093161 |
13 | 2aab17479 |
14 | 17cd82585 |
15 | d7db2861 |
hex | 89c44e19 |
2311343641 has 2 divisors, whose sum is σ = 2311343642. Its totient is φ = 2311343640.
The previous prime is 2311343633. The next prime is 2311343653. The reversal of 2311343641 is 1463431132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2081184400 + 230159241 = 45620^2 + 15171^2 .
It is a cyclic number.
It is not a de Polignac number, because 2311343641 - 23 = 2311343633 is a prime.
It is a super-2 number, since 2×23113436412 = 10684618853582273762, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2311373641) 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, 1155671820 + 1155671821.
It is an arithmetic number, because the mean of its divisors is an integer number (1155671821).
Almost surely, 22311343641 is an apocalyptic number.
It is an amenable number.
2311343641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2311343641 is an equidigital number, since it uses as much as digits as its factorization.
2311343641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 28.
The square root of 2311343641 is about 48076.4354023881. The cubic root of 2311343641 is about 1322.1726617932.
Adding to 2311343641 its reverse (1463431132), we get a palindrome (3774774773).
The spelling of 2311343641 in words is "two billion, three hundred eleven million, three hundred forty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •