Base | Representation |
---|---|
bin | 10100100010001110010… |
… | …001011100001101101011 |
3 | 11222220101111201212101121 |
4 | 110202032101130031223 |
5 | 141110001332203041 |
6 | 3000133402200111 |
7 | 203644161605641 |
oct | 24421621341553 |
9 | 4886344655347 |
10 | 1411136209771 |
11 | 4a4506669542 |
12 | 1a95a27b3037 |
13 | a30b9b12602 |
14 | 4c429615191 |
15 | 26a90b577d1 |
hex | 1488e45c36b |
1411136209771 has 2 divisors, whose sum is σ = 1411136209772. Its totient is φ = 1411136209770.
The previous prime is 1411136209739. The next prime is 1411136209781. The reversal of 1411136209771 is 1779026311141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1411136209771 - 25 = 1411136209739 is a prime.
It is not a weakly prime, because it can be changed into another prime (1411136209711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705568104885 + 705568104886.
It is an arithmetic number, because the mean of its divisors is an integer number (705568104886).
Almost surely, 21411136209771 is an apocalyptic number.
1411136209771 is a deficient number, since it is larger than the sum of its proper divisors (1).
1411136209771 is an equidigital number, since it uses as much as digits as its factorization.
1411136209771 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504, while the sum is 43.
The spelling of 1411136209771 in words is "one trillion, four hundred eleven billion, one hundred thirty-six million, two hundred nine thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •