Base | Representation |
---|---|
bin | 1011111000011111011111… |
… | …1011111001011001100101 |
3 | 1201021000110010112200220021 |
4 | 2332013313323321121211 |
5 | 3203024414214033333 |
6 | 43442014403035141 |
7 | 2515632504010243 |
oct | 276076773713145 |
9 | 51230403480807 |
10 | 13065155221093 |
11 | 41879a0572758 |
12 | 157014606bab1 |
13 | 73a067480691 |
14 | 3324dd423793 |
15 | 179cc47a282d |
hex | be1f7ef9665 |
13065155221093 has 2 divisors, whose sum is σ = 13065155221094. Its totient is φ = 13065155221092.
The previous prime is 13065155221073. The next prime is 13065155221127. The reversal of 13065155221093 is 39012255156031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12739745441284 + 325409779809 = 3569278^2 + 570447^2 .
It is a cyclic number.
It is not a de Polignac number, because 13065155221093 - 229 = 13064618350181 is a prime.
It is a super-2 number, since 2×130651552210932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13065155221043) 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, 6532577610546 + 6532577610547.
It is an arithmetic number, because the mean of its divisors is an integer number (6532577610547).
Almost surely, 213065155221093 is an apocalyptic number.
It is an amenable number.
13065155221093 is a deficient number, since it is larger than the sum of its proper divisors (1).
13065155221093 is an equidigital number, since it uses as much as digits as its factorization.
13065155221093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 43.
The spelling of 13065155221093 in words is "thirteen trillion, sixty-five billion, one hundred fifty-five million, two hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •