Base | Representation |
---|---|
bin | 111011110110110110011… |
… | …011101110100111110101 |
3 | 112120020021001020001010222 |
4 | 323312312123232213311 |
5 | 1014343112133040222 |
6 | 12425351102224125 |
7 | 603115336502123 |
oct | 73666633564765 |
9 | 15506231201128 |
10 | 4113344424437 |
11 | 1346506769316 |
12 | 56523a885045 |
13 | 23ab6b1602c1 |
14 | 103130784913 |
15 | 71ee69cd542 |
hex | 3bdb66ee9f5 |
4113344424437 has 2 divisors, whose sum is σ = 4113344424438. Its totient is φ = 4113344424436.
The previous prime is 4113344424407. The next prime is 4113344424439. The reversal of 4113344424437 is 7344244433114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3994298033476 + 119046390961 = 1998574^2 + 345031^2 .
It is a cyclic number.
It is not a de Polignac number, because 4113344424437 - 232 = 4109049457141 is a prime.
Together with 4113344424439, 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 (4113344424439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2056672212218 + 2056672212219.
It is an arithmetic number, because the mean of its divisors is an integer number (2056672212219).
Almost surely, 24113344424437 is an apocalyptic number.
It is an amenable number.
4113344424437 is a deficient number, since it is larger than the sum of its proper divisors (1).
4113344424437 is an equidigital number, since it uses as much as digits as its factorization.
4113344424437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1548288, while the sum is 44.
The spelling of 4113344424437 in words is "four trillion, one hundred thirteen billion, three hundred forty-four million, four hundred twenty-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •