Base | Representation |
---|---|
bin | 10011010111101100011… |
… | …001100111010100101101 |
3 | 11201020211102020122010122 |
4 | 103113230121213110231 |
5 | 133302103411011414 |
6 | 2455300505014325 |
7 | 165112113042035 |
oct | 23275431472455 |
9 | 4636742218118 |
10 | 1331111032109 |
11 | 473580526081 |
12 | 195b8a4843a5 |
13 | 986a5703791 |
14 | 485d73a48c5 |
15 | 2495a363b8e |
hex | 135ec66752d |
1331111032109 has 2 divisors, whose sum is σ = 1331111032110. Its totient is φ = 1331111032108.
The previous prime is 1331111032103. The next prime is 1331111032157. The reversal of 1331111032109 is 9012301111331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 805725254884 + 525385777225 = 897622^2 + 724835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1331111032109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331111032103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665555516054 + 665555516055.
It is an arithmetic number, because the mean of its divisors is an integer number (665555516055).
Almost surely, 21331111032109 is an apocalyptic number.
It is an amenable number.
1331111032109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331111032109 is an equidigital number, since it uses as much as digits as its factorization.
1331111032109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 26.
The spelling of 1331111032109 in words is "one trillion, three hundred thirty-one billion, one hundred eleven million, thirty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •