Base | Representation |
---|---|
bin | 1000100111101101… |
… | …1000011100111001 |
3 | 12222021021200022022 |
4 | 2021323120130321 |
5 | 14214343421431 |
6 | 1021342004225 |
7 | 111226026404 |
oct | 21173303471 |
9 | 5867250268 |
10 | 2314045241 |
11 | a88244492 |
12 | 546b76675 |
13 | 2ab552051 |
14 | 17d486d3b |
15 | d824807b |
hex | 89ed8739 |
2314045241 has 2 divisors, whose sum is σ = 2314045242. Its totient is φ = 2314045240.
The previous prime is 2314045183. The next prime is 2314045247. The reversal of 2314045241 is 1425404132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1550075641 + 763969600 = 39371^2 + 27640^2 .
It is a cyclic number.
It is not a de Polignac number, because 2314045241 - 210 = 2314044217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2314045241.
It is not a weakly prime, because it can be changed into another prime (2314045247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1157022620 + 1157022621.
It is an arithmetic number, because the mean of its divisors is an integer number (1157022621).
Almost surely, 22314045241 is an apocalyptic number.
It is an amenable number.
2314045241 is a deficient number, since it is larger than the sum of its proper divisors (1).
2314045241 is an equidigital number, since it uses as much as digits as its factorization.
2314045241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 26.
The square root of 2314045241 is about 48104.5241219576. The cubic root of 2314045241 is about 1322.6875990511.
Adding to 2314045241 its reverse (1425404132), we get a palindrome (3739449373).
The spelling of 2314045241 in words is "two billion, three hundred fourteen million, forty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •