Base | Representation |
---|---|
bin | 1011001000110010110… |
… | …0010000000000000001 |
3 | 200021212202000211110122 |
4 | 2302030230100000001 |
5 | 11113330234034022 |
6 | 223522214110025 |
7 | 16552362263666 |
oct | 2621454200001 |
9 | 607782024418 |
10 | 191338971137 |
11 | 74167952006 |
12 | 310bb04b315 |
13 | 15073b63122 |
14 | 9391b05a6d |
15 | 4e9ce03742 |
hex | 2c8cb10001 |
191338971137 has 2 divisors, whose sum is σ = 191338971138. Its totient is φ = 191338971136.
The previous prime is 191338971107. The next prime is 191338971139. The reversal of 191338971137 is 731179833191.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 169319082256 + 22019888881 = 411484^2 + 148391^2 .
It is a cyclic number.
It is not a de Polignac number, because 191338971137 - 26 = 191338971073 is a prime.
It is a super-2 number, since 2×1913389711372 (a number of 23 digits) contains 22 as substring.
Together with 191338971139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (191338971139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 95669485568 + 95669485569.
It is an arithmetic number, because the mean of its divisors is an integer number (95669485569).
Almost surely, 2191338971137 is an apocalyptic number.
It is an amenable number.
191338971137 is a deficient number, since it is larger than the sum of its proper divisors (1).
191338971137 is an equidigital number, since it uses as much as digits as its factorization.
191338971137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 857304, while the sum is 53.
The spelling of 191338971137 in words is "one hundred ninety-one billion, three hundred thirty-eight million, nine hundred seventy-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •