Base | Representation |
---|---|
bin | 1011111110001100111111… |
… | …0101010110000010101001 |
3 | 1201121101200200112022212222 |
4 | 2333203033311112002221 |
5 | 3211131332231200234 |
6 | 43555042103443425 |
7 | 2526005006341232 |
oct | 277431765260251 |
9 | 51541620468788 |
10 | 13163266662569 |
11 | 4215567957891 |
12 | 1587167456575 |
13 | 7463a193426a |
14 | 337169718089 |
15 | 17c617cde42e |
hex | bf8cfd560a9 |
13163266662569 has 2 divisors, whose sum is σ = 13163266662570. Its totient is φ = 13163266662568.
The previous prime is 13163266662529. The next prime is 13163266662587. The reversal of 13163266662569 is 96526666236131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12498968310544 + 664298352025 = 3535388^2 + 815045^2 .
It is an emirp because it is prime and its reverse (96526666236131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13163266662569 is a prime.
It is a super-2 number, since 2×131632666625692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13163266662529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6581633331284 + 6581633331285.
It is an arithmetic number, because the mean of its divisors is an integer number (6581633331285).
Almost surely, 213163266662569 is an apocalyptic number.
It is an amenable number.
13163266662569 is a deficient number, since it is larger than the sum of its proper divisors (1).
13163266662569 is an equidigital number, since it uses as much as digits as its factorization.
13163266662569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75582720, while the sum is 62.
The spelling of 13163266662569 in words is "thirteen trillion, one hundred sixty-three billion, two hundred sixty-six million, six hundred sixty-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •