Base | Representation |
---|---|
bin | 110111010001110001100110… |
… | …001111110000111011110101 |
3 | 1011212210110211202011120020201 |
4 | 313101301212033300323311 |
5 | 223331140030310401123 |
6 | 2221021014453000501 |
7 | 102131260436533135 |
oct | 6721614617607365 |
9 | 1155713752146221 |
10 | 243114044231413 |
11 | 705110a5aa9113 |
12 | 23325169623131 |
13 | a58672c6c0674 |
14 | 4406ad5364ac5 |
15 | 1d18e4a6a85ad |
hex | dd1c663f0ef5 |
243114044231413 has 2 divisors, whose sum is σ = 243114044231414. Its totient is φ = 243114044231412.
The previous prime is 243114044231329. The next prime is 243114044231417. The reversal of 243114044231413 is 314132440411342.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124291683309924 + 118822360921489 = 11148618^2 + 10900567^2 .
It is a cyclic number.
It is not a de Polignac number, because 243114044231413 - 221 = 243114042134261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243114044231417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121557022115706 + 121557022115707.
It is an arithmetic number, because the mean of its divisors is an integer number (121557022115707).
Almost surely, 2243114044231413 is an apocalyptic number.
It is an amenable number.
243114044231413 is a deficient number, since it is larger than the sum of its proper divisors (1).
243114044231413 is an equidigital number, since it uses as much as digits as its factorization.
243114044231413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 110592, while the sum is 37.
Adding to 243114044231413 its reverse (314132440411342), we get a palindrome (557246484642755).
The spelling of 243114044231413 in words is "two hundred forty-three trillion, one hundred fourteen billion, forty-four million, two hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •