Base | Representation |
---|---|
bin | 111111100001001… |
… | …0101110101000011 |
3 | 12111112110021120122 |
4 | 1333002111311003 |
5 | 13331104221011 |
6 | 551253330455 |
7 | 103546631213 |
oct | 17702256503 |
9 | 5445407518 |
10 | 2131320131 |
11 | 9a40903a6 |
12 | 4b5936a2b |
13 | 27c735995 |
14 | 1630c0243 |
15 | c71a23db |
hex | 7f095d43 |
2131320131 has 2 divisors, whose sum is σ = 2131320132. Its totient is φ = 2131320130.
The previous prime is 2131320127. The next prime is 2131320133. The reversal of 2131320131 is 1310231312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2131320131 - 22 = 2131320127 is a prime.
It is a super-2 number, since 2×21313201312 = 9085051001611714322, which contains 22 as substring.
Together with 2131320133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2131320133) 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, 1065660065 + 1065660066.
It is an arithmetic number, because the mean of its divisors is an integer number (1065660066).
Almost surely, 22131320131 is an apocalyptic number.
2131320131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131320131 is an equidigital number, since it uses as much as digits as its factorization.
2131320131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 2131320131 is about 46166.2228366151. Note that the first 3 decimals coincide. The cubic root of 2131320131 is about 1286.9141092187.
Adding to 2131320131 its reverse (1310231312), we get a palindrome (3441551443).
The spelling of 2131320131 in words is "two billion, one hundred thirty-one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •