Base | Representation |
---|---|
bin | 1000100111000101… |
… | …1010111110010011 |
3 | 12222002101000112112 |
4 | 2021301122332103 |
5 | 14213211343011 |
6 | 1021210015535 |
7 | 111164603006 |
oct | 21161327623 |
9 | 5862330475 |
10 | 2311434131 |
11 | a86820746 |
12 | 5461175ab |
13 | 2aab49706 |
14 | 17cda753d |
15 | d7dce58b |
hex | 89c5af93 |
2311434131 has 2 divisors, whose sum is σ = 2311434132. Its totient is φ = 2311434130.
The previous prime is 2311434127. The next prime is 2311434217. The reversal of 2311434131 is 1314341132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2311434131 - 22 = 2311434127 is a prime.
It is a super-3 number, since 3×23114341313 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 2311434097 and 2311434106.
It is not a weakly prime, because it can be changed into another prime (2311430131) 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, 1155717065 + 1155717066.
It is an arithmetic number, because the mean of its divisors is an integer number (1155717066).
Almost surely, 22311434131 is an apocalyptic number.
2311434131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2311434131 is an equidigital number, since it uses as much as digits as its factorization.
2311434131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 23.
The square root of 2311434131 is about 48077.3764987234. The cubic root of 2311434131 is about 1322.1899160922.
Adding to 2311434131 its reverse (1314341132), we get a palindrome (3625775263).
The spelling of 2311434131 in words is "two billion, three hundred eleven million, four hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •