Base | Representation |
---|---|
bin | 11110110001000011111… |
… | …010100001111011110001 |
3 | 21111010021122110020202202 |
4 | 132301003322201323301 |
5 | 234120002402421244 |
6 | 4255140144352545 |
7 | 305515262516501 |
oct | 36610372417361 |
9 | 7433248406682 |
10 | 2114263326449 |
11 | 74572159018a |
12 | 2a1912615755 |
13 | 1244b30b0041 |
14 | 7448bd71a01 |
15 | 39ee451304e |
hex | 1ec43ea1ef1 |
2114263326449 has 2 divisors, whose sum is σ = 2114263326450. Its totient is φ = 2114263326448.
The previous prime is 2114263326421. The next prime is 2114263326451. The reversal of 2114263326449 is 9446233624112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1120517517025 + 993745809424 = 1058545^2 + 996868^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2114263326449 is a prime.
It is a Sophie Germain prime.
Together with 2114263326451, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2114263326349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1057131663224 + 1057131663225.
It is an arithmetic number, because the mean of its divisors is an integer number (1057131663225).
Almost surely, 22114263326449 is an apocalyptic number.
It is an amenable number.
2114263326449 is a deficient number, since it is larger than the sum of its proper divisors (1).
2114263326449 is an equidigital number, since it uses as much as digits as its factorization.
2114263326449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1492992, while the sum is 47.
The spelling of 2114263326449 in words is "two trillion, one hundred fourteen billion, two hundred sixty-three million, three hundred twenty-six thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •