Base | Representation |
---|---|
bin | 1100000110011111111011… |
… | …1111111110000001010001 |
3 | 1202010000120111220102222112 |
4 | 3001213332333332001101 |
5 | 3221000230211211211 |
6 | 44144332454115105 |
7 | 2542211633011103 |
oct | 301477677760121 |
9 | 52100514812875 |
10 | 13305791897681 |
11 | 426aa55710498 |
12 | 15aa90294ba95 |
13 | 75696671c8ca |
14 | 34000a485573 |
15 | 1811aa57388b |
hex | c19feffe051 |
13305791897681 has 2 divisors, whose sum is σ = 13305791897682. Its totient is φ = 13305791897680.
The previous prime is 13305791897653. The next prime is 13305791897693. The reversal of 13305791897681 is 18679819750331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8861284657681 + 4444507240000 = 2976791^2 + 2108200^2 .
It is an emirp because it is prime and its reverse (18679819750331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13305791897681 is a prime.
It is a super-2 number, since 2×133057918976812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13305791897641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6652895948840 + 6652895948841.
It is an arithmetic number, because the mean of its divisors is an integer number (6652895948841).
Almost surely, 213305791897681 is an apocalyptic number.
It is an amenable number.
13305791897681 is a deficient number, since it is larger than the sum of its proper divisors (1).
13305791897681 is an equidigital number, since it uses as much as digits as its factorization.
13305791897681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 68584320, while the sum is 68.
The spelling of 13305791897681 in words is "thirteen trillion, three hundred five billion, seven hundred ninety-one million, eight hundred ninety-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •