Base | Representation |
---|---|
bin | 10111111110011… |
… | …01001010111101 |
3 | 112000102212120112 |
4 | 23333031022331 |
5 | 402441242042 |
6 | 31542355405 |
7 | 4661323004 |
oct | 1377151275 |
9 | 460385515 |
10 | 201118397 |
11 | a3587257 |
12 | 5742bb65 |
13 | 3288938c |
14 | 1c9d3c3b |
15 | 129ca982 |
hex | bfcd2bd |
201118397 has 2 divisors, whose sum is σ = 201118398. Its totient is φ = 201118396.
The previous prime is 201118369. The next prime is 201118409. The reversal of 201118397 is 793811102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 140683321 + 60435076 = 11861^2 + 7774^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201118397 is a prime.
It is a super-2 number, since 2×2011183972 = 80897219223699218, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201118327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100559198 + 100559199.
It is an arithmetic number, because the mean of its divisors is an integer number (100559199).
Almost surely, 2201118397 is an apocalyptic number.
It is an amenable number.
201118397 is a deficient number, since it is larger than the sum of its proper divisors (1).
201118397 is an equidigital number, since it uses as much as digits as its factorization.
201118397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 32.
The square root of 201118397 is about 14181.6218042930. The cubic root of 201118397 is about 585.8915929336.
Adding to 201118397 its reverse (793811102), we get a palindrome (994929499).
The spelling of 201118397 in words is "two hundred one million, one hundred eighteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •