Base | Representation |
---|---|
bin | 1011111011010010001101… |
… | …1110010011101010101001 |
3 | 1201102121021121010022220011 |
4 | 2332310203132103222221 |
5 | 3204321142324131441 |
6 | 43520031111331521 |
7 | 2522251410324163 |
oct | 276644336235251 |
9 | 51377247108804 |
10 | 13113130302121 |
11 | 41a627a219153 |
12 | 15794b4980ba1 |
13 | 74174185c9a5 |
14 | 334970c4d933 |
15 | 17b1814b1581 |
hex | bed23793aa9 |
13113130302121 has 2 divisors, whose sum is σ = 13113130302122. Its totient is φ = 13113130302120.
The previous prime is 13113130302109. The next prime is 13113130302161. The reversal of 13113130302121 is 12120303131131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11455950392896 + 1657179909225 = 3384664^2 + 1287315^2 .
It is a cyclic number.
It is not a de Polignac number, because 13113130302121 - 219 = 13113129777833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13113130302092 and 13113130302101.
It is not a weakly prime, because it can be changed into another prime (13113130302161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556565151060 + 6556565151061.
It is an arithmetic number, because the mean of its divisors is an integer number (6556565151061).
Almost surely, 213113130302121 is an apocalyptic number.
It is an amenable number.
13113130302121 is a deficient number, since it is larger than the sum of its proper divisors (1).
13113130302121 is an equidigital number, since it uses as much as digits as its factorization.
13113130302121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13113130302121 its reverse (12120303131131), we get a palindrome (25233433433252).
The spelling of 13113130302121 in words is "thirteen trillion, one hundred thirteen billion, one hundred thirty million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •