Base | Representation |
---|---|
bin | 111111100001111… |
… | …0101001010111101 |
3 | 12111120012010021102 |
4 | 1333003311022331 |
5 | 13331204220103 |
6 | 551305542445 |
7 | 103553145602 |
oct | 17703651275 |
9 | 5446163242 |
10 | 2131710653 |
11 | 9a4327846 |
12 | 4b5aa4a25 |
13 | 27c841667 |
14 | 1631826a9 |
15 | c722ce88 |
hex | 7f0f52bd |
2131710653 has 2 divisors, whose sum is σ = 2131710654. Its totient is φ = 2131710652.
The previous prime is 2131710599. The next prime is 2131710673. The reversal of 2131710653 is 3560171312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1713794404 + 417916249 = 41398^2 + 20443^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2131710653 is a prime.
It is a super-2 number, since 2×21317106532 = 9088380616227372818, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2131710673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065855326 + 1065855327.
It is an arithmetic number, because the mean of its divisors is an integer number (1065855327).
Almost surely, 22131710653 is an apocalyptic number.
It is an amenable number.
2131710653 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131710653 is an equidigital number, since it uses as much as digits as its factorization.
2131710653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3780, while the sum is 29.
The square root of 2131710653 is about 46170.4521636945. The cubic root of 2131710653 is about 1286.9927048853.
Adding to 2131710653 its reverse (3560171312), we get a palindrome (5691881965).
The spelling of 2131710653 in words is "two billion, one hundred thirty-one million, seven hundred ten thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •