Base | Representation |
---|---|
bin | 111111100001001… |
… | …1011010010110101 |
3 | 12111112111102021202 |
4 | 1333002123102311 |
5 | 13331110430032 |
6 | 551254022245 |
7 | 103550053403 |
oct | 17702332265 |
9 | 5445442252 |
10 | 2131342517 |
11 | 9a40a61a7 |
12 | 4b5947985 |
13 | 27c742c25 |
14 | 1630c8473 |
15 | c71a8d62 |
hex | 7f09b4b5 |
2131342517 has 2 divisors, whose sum is σ = 2131342518. Its totient is φ = 2131342516.
The previous prime is 2131342481. The next prime is 2131342519. The reversal of 2131342517 is 7152431312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2045391076 + 85951441 = 45226^2 + 9271^2 .
It is a cyclic number.
It is not a de Polignac number, because 2131342517 - 26 = 2131342453 is a prime.
Together with 2131342519, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2131342517.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2131342519) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065671258 + 1065671259.
It is an arithmetic number, because the mean of its divisors is an integer number (1065671259).
Almost surely, 22131342517 is an apocalyptic number.
It is an amenable number.
2131342517 is a deficient number, since it is larger than the sum of its proper divisors (1).
2131342517 is an equidigital number, since it uses as much as digits as its factorization.
2131342517 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5040, while the sum is 29.
The square root of 2131342517 is about 46166.4652859627. The cubic root of 2131342517 is about 1286.9186148391.
Adding to 2131342517 its reverse (7152431312), we get a palindrome (9283773829).
The spelling of 2131342517 in words is "two billion, one hundred thirty-one million, three hundred forty-two thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •