Base | Representation |
---|---|
bin | 1011111010010100011011… |
… | …1101010111011000010001 |
3 | 1201101000110210102011121021 |
4 | 2332211012331113120101 |
5 | 3204033211204332134 |
6 | 43504245311355441 |
7 | 2521123420226401 |
oct | 276450675273021 |
9 | 51330423364537 |
10 | 13096545777169 |
11 | 419a239735088 |
12 | 1576246822b81 |
13 | 73ccca96880a |
14 | 333c3a402801 |
15 | 17aa105080b4 |
hex | be946f57611 |
13096545777169 has 2 divisors, whose sum is σ = 13096545777170. Its totient is φ = 13096545777168.
The previous prime is 13096545777083. The next prime is 13096545777233. The reversal of 13096545777169 is 96177754569031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12896092578769 + 200453198400 = 3591113^2 + 447720^2 .
It is a cyclic number.
It is not a de Polignac number, because 13096545777169 - 211 = 13096545775121 is a prime.
It is a super-2 number, since 2×130965457771692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13096545777098 and 13096545777107.
It is not a weakly prime, because it can be changed into another prime (13096545777269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6548272888584 + 6548272888585.
It is an arithmetic number, because the mean of its divisors is an integer number (6548272888585).
Almost surely, 213096545777169 is an apocalyptic number.
It is an amenable number.
13096545777169 is a deficient number, since it is larger than the sum of its proper divisors (1).
13096545777169 is an equidigital number, since it uses as much as digits as its factorization.
13096545777169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300056400, while the sum is 70.
The spelling of 13096545777169 in words is "thirteen trillion, ninety-six billion, five hundred forty-five million, seven hundred seventy-seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •