Base | Representation |
---|---|
bin | 1000000001000110… |
… | …1110101101100111 |
3 | 12112222121121022112 |
4 | 2000101232231213 |
5 | 13401421201211 |
6 | 553315351235 |
7 | 104221546442 |
oct | 20021565547 |
9 | 5488547275 |
10 | 2152131431 |
11 | a0490521a |
12 | 5008b251b |
13 | 283b41468 |
14 | 165b7a659 |
15 | c8e1388b |
hex | 8046eb67 |
2152131431 has 2 divisors, whose sum is σ = 2152131432. Its totient is φ = 2152131430.
The previous prime is 2152131427. The next prime is 2152131433. The reversal of 2152131431 is 1341312512.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2152131431 - 22 = 2152131427 is a prime.
It is a super-2 number, since 2×21521314312 = 9263339392596215522, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 2152131433, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2152131397 and 2152131406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2152131433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1076065715 + 1076065716.
It is an arithmetic number, because the mean of its divisors is an integer number (1076065716).
Almost surely, 22152131431 is an apocalyptic number.
2152131431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2152131431 is an equidigital number, since it uses as much as digits as its factorization.
2152131431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720, while the sum is 23.
The square root of 2152131431 is about 46391.0705955359. The cubic root of 2152131431 is about 1291.0892450629.
Adding to 2152131431 its reverse (1341312512), we get a palindrome (3493443943).
The spelling of 2152131431 in words is "two billion, one hundred fifty-two million, one hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •