Base | Representation |
---|---|
bin | 1011111010100101110110… |
… | …1001001100000000110001 |
3 | 1201101110112122021220200102 |
4 | 2332221131221030000301 |
5 | 3204122300130042433 |
6 | 43510341253002145 |
7 | 2521350322616555 |
oct | 276513551140061 |
9 | 51343478256612 |
10 | 13101221330993 |
11 | 41a1218990954 |
12 | 1577130623355 |
13 | 74059451a503 |
14 | 334161369865 |
15 | 17abd5c224e8 |
hex | bea5da4c031 |
13101221330993 has 2 divisors, whose sum is σ = 13101221330994. Its totient is φ = 13101221330992.
The previous prime is 13101221330959. The next prime is 13101221331017. The reversal of 13101221330993 is 39903312210131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13100548603024 + 672727969 = 3619468^2 + 25937^2 .
It is a cyclic number.
It is not a de Polignac number, because 13101221330993 - 26 = 13101221330929 is a prime.
It is not a weakly prime, because it can be changed into another prime (13101221338993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550610665496 + 6550610665497.
It is an arithmetic number, because the mean of its divisors is an integer number (6550610665497).
Almost surely, 213101221330993 is an apocalyptic number.
It is an amenable number.
13101221330993 is a deficient number, since it is larger than the sum of its proper divisors (1).
13101221330993 is an equidigital number, since it uses as much as digits as its factorization.
13101221330993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26244, while the sum is 38.
The spelling of 13101221330993 in words is "thirteen trillion, one hundred one billion, two hundred twenty-one million, three hundred thirty thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •