Base | Representation |
---|---|
bin | 1011101101001010001… |
… | …1011100000111101101 |
3 | 201020002002000100012112 |
4 | 2323102203130013231 |
5 | 11243323324014242 |
6 | 232215020213405 |
7 | 20346320210015 |
oct | 2732243340755 |
9 | 636062010175 |
10 | 201101001197 |
11 | 783172aa748 |
12 | 32b8439a265 |
13 | 15c6b460785 |
14 | 9a3a400c45 |
15 | 536ee56c82 |
hex | 2ed28dc1ed |
201101001197 has 2 divisors, whose sum is σ = 201101001198. Its totient is φ = 201101001196.
The previous prime is 201101001191. The next prime is 201101001223. The reversal of 201101001197 is 791100101102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 159333495556 + 41767505641 = 399166^2 + 204371^2 .
It is a cyclic number.
It is not a de Polignac number, because 201101001197 - 212 = 201100997101 is a prime.
It is a super-2 number, since 2×2011010011972 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201101001191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550500598 + 100550500599.
It is an arithmetic number, because the mean of its divisors is an integer number (100550500599).
Almost surely, 2201101001197 is an apocalyptic number.
It is an amenable number.
201101001197 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101001197 is an equidigital number, since it uses as much as digits as its factorization.
201101001197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 23.
Adding to 201101001197 its reverse (791100101102), we get a palindrome (992201102299).
The spelling of 201101001197 in words is "two hundred one billion, one hundred one million, one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •