Base | Representation |
---|---|
bin | 1100000001011111100111… |
… | …1010010110110001010101 |
3 | 1201210210122002111221011222 |
4 | 3000113321322112301111 |
5 | 3213043131120203242 |
6 | 44041032351340125 |
7 | 2533046101050302 |
oct | 300277172266125 |
9 | 51723562457158 |
10 | 13219807194197 |
11 | 423754158107a |
12 | 1596106821645 |
13 | 74b812746636 |
14 | 339bb09600a9 |
15 | 17dd2698e5d2 |
hex | c05f9e96c55 |
13219807194197 has 2 divisors, whose sum is σ = 13219807194198. Its totient is φ = 13219807194196.
The previous prime is 13219807194127. The next prime is 13219807194199. The reversal of 13219807194197 is 79149170891231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12984498766801 + 235308427396 = 3603401^2 + 485086^2 .
It is a cyclic number.
It is not a de Polignac number, because 13219807194197 - 212 = 13219807190101 is a prime.
Together with 13219807194199, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13219807194199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6609903597098 + 6609903597099.
It is an arithmetic number, because the mean of its divisors is an integer number (6609903597099).
Almost surely, 213219807194197 is an apocalyptic number.
It is an amenable number.
13219807194197 is a deficient number, since it is larger than the sum of its proper divisors (1).
13219807194197 is an equidigital number, since it uses as much as digits as its factorization.
13219807194197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6858432, while the sum is 62.
The spelling of 13219807194197 in words is "thirteen trillion, two hundred nineteen billion, eight hundred seven million, one hundred ninety-four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •