Base | Representation |
---|---|
bin | 1011111011101111100111… |
… | …0011010110110100111001 |
3 | 1201110100122112001222120102 |
4 | 2332323321303112310321 |
5 | 3204433322401032414 |
6 | 43523414111005145 |
7 | 2522651064153515 |
oct | 276737163266471 |
9 | 51410575058512 |
10 | 13121021111609 |
11 | 41a9659398104 |
12 | 157ab375097b5 |
13 | 7423cb592028 |
14 | 3350bcc13145 |
15 | 17b4940ddede |
hex | beef9cd6d39 |
13121021111609 has 2 divisors, whose sum is σ = 13121021111610. Its totient is φ = 13121021111608.
The previous prime is 13121021111533. The next prime is 13121021111629. The reversal of 13121021111609 is 90611112012131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13022426995600 + 98594116009 = 3608660^2 + 313997^2 .
It is a cyclic number.
It is not a de Polignac number, because 13121021111609 - 216 = 13121021046073 is a prime.
It is a super-2 number, since 2×131210211116092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13121021111629) 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, 6560510555804 + 6560510555805.
It is an arithmetic number, because the mean of its divisors is an integer number (6560510555805).
Almost surely, 213121021111609 is an apocalyptic number.
It is an amenable number.
13121021111609 is a deficient number, since it is larger than the sum of its proper divisors (1).
13121021111609 is an equidigital number, since it uses as much as digits as its factorization.
13121021111609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 29.
The spelling of 13121021111609 in words is "thirteen trillion, one hundred twenty-one billion, twenty-one million, one hundred eleven thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •