Base | Representation |
---|---|
bin | 111111100001001… |
… | …0011101010010101 |
3 | 12111112102211101211 |
4 | 1333002103222111 |
5 | 13331103430003 |
6 | 551253221421 |
7 | 103546563301 |
oct | 17702235225 |
9 | 5445384354 |
10 | 2131311253 |
11 | 9a4084765 |
12 | 4b5931871 |
13 | 27c731926 |
14 | 1630bad01 |
15 | c719e96d |
hex | 7f093a95 |
2131311253 has 2 divisors, whose sum is σ = 2131311254. Its totient is φ = 2131311252.
The previous prime is 2131311251. The next prime is 2131311319. The reversal of 2131311253 is 3521131312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1282929124 + 848382129 = 35818^2 + 29127^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131311253 - 21 = 2131311251 is a prime.
Together with 2131311251, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2131311251) 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, 1065655626 + 1065655627.
It is an arithmetic number, because the mean of its divisors is an integer number (1065655627).
Almost surely, 22131311253 is an apocalyptic number.
It is an amenable number.
2131311253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131311253 is an equidigital number, since it uses as much as digits as its factorization.
2131311253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 540, while the sum is 22.
The square root of 2131311253 is about 46166.1266839660. The cubic root of 2131311253 is about 1286.9123223387.
Adding to 2131311253 its reverse (3521131312), we get a palindrome (5652442565).
The spelling of 2131311253 in words is "two billion, one hundred thirty-one million, three hundred eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •