Base | Representation |
---|---|
bin | 1000001111111011… |
… | …1100000011111101 |
3 | 12201022121211002102 |
4 | 2003332330003331 |
5 | 14013331023422 |
6 | 1003420234445 |
7 | 105605234432 |
oct | 20376740375 |
9 | 5638554072 |
10 | 2214314237 |
11 | a36a17073 |
12 | 51969ba25 |
13 | 2939a3b15 |
14 | 170125b89 |
15 | ce5e8192 |
hex | 83fbc0fd |
2214314237 has 2 divisors, whose sum is σ = 2214314238. Its totient is φ = 2214314236.
The previous prime is 2214314233. The next prime is 2214314239. The reversal of 2214314237 is 7324134122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2137120441 + 77193796 = 46229^2 + 8786^2 .
It is a cyclic number.
It is not a de Polignac number, because 2214314237 - 22 = 2214314233 is a prime.
Together with 2214314239, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2214314231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1107157118 + 1107157119.
It is an arithmetic number, because the mean of its divisors is an integer number (1107157119).
Almost surely, 22214314237 is an apocalyptic number.
It is an amenable number.
2214314237 is a deficient number, since it is larger than the sum of its proper divisors (1).
2214314237 is an equidigital number, since it uses as much as digits as its factorization.
2214314237 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8064, while the sum is 29.
The square root of 2214314237 is about 47056.5004754922. The cubic root of 2214314237 is about 1303.4061048203.
Adding to 2214314237 its reverse (7324134122), we get a palindrome (9538448359).
The spelling of 2214314237 in words is "two billion, two hundred fourteen million, three hundred fourteen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •