Base | Representation |
---|---|
bin | 100111111011011… |
… | …1100110111010101 |
3 | 10110101002011010122 |
4 | 1033312330313111 |
5 | 10220442231031 |
6 | 340540401325 |
7 | 45126104303 |
oct | 11766746725 |
9 | 3411064118 |
10 | 1339805141 |
11 | 628315484 |
12 | 314846245 |
13 | 184763c0c |
14 | c9d23273 |
15 | 7c95447b |
hex | 4fdbcdd5 |
1339805141 has 2 divisors, whose sum is σ = 1339805142. Its totient is φ = 1339805140.
The previous prime is 1339805107. The next prime is 1339805143. The reversal of 1339805141 is 1415089331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1164242641 + 175562500 = 34121^2 + 13250^2 .
It is a cyclic number.
It is not a de Polignac number, because 1339805141 - 226 = 1272696277 is a prime.
Together with 1339805143, 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 (1339805143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 669902570 + 669902571.
It is an arithmetic number, because the mean of its divisors is an integer number (669902571).
Almost surely, 21339805141 is an apocalyptic number.
It is an amenable number.
1339805141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1339805141 is an equidigital number, since it uses as much as digits as its factorization.
1339805141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 35.
The square root of 1339805141 is about 36603.3487675650. The cubic root of 1339805141 is about 1102.4203293227.
The spelling of 1339805141 in words is "one billion, three hundred thirty-nine million, eight hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •