Base | Representation |
---|---|
bin | 10111111110011… |
… | …00001011001101 |
3 | 112000102122222102 |
4 | 23333030023031 |
5 | 402441124232 |
6 | 31542324445 |
7 | 4661305055 |
oct | 1377141315 |
9 | 460378872 |
10 | 201114317 |
11 | a3584188 |
12 | 57429725 |
13 | 32887571 |
14 | 1c9d2565 |
15 | 129c9662 |
hex | bfcc2cd |
201114317 has 2 divisors, whose sum is σ = 201114318. Its totient is φ = 201114316.
The previous prime is 201114293. The next prime is 201114367. The reversal of 201114317 is 713411102.
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., 196812841 + 4301476 = 14029^2 + 2074^2 .
It is a cyclic number.
It is not a de Polignac number, because 201114317 - 26 = 201114253 is a prime.
It is a super-3 number, since 3×2011143173 (a number of 26 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201114367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100557158 + 100557159.
It is an arithmetic number, because the mean of its divisors is an integer number (100557159).
Almost surely, 2201114317 is an apocalyptic number.
It is an amenable number.
201114317 is a deficient number, since it is larger than the sum of its proper divisors (1).
201114317 is an equidigital number, since it uses as much as digits as its factorization.
201114317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 201114317 is about 14181.4779554178. The cubic root of 201114317 is about 585.8876309989.
Adding to 201114317 its reverse (713411102), we get a palindrome (914525419).
The spelling of 201114317 in words is "two hundred one million, one hundred fourteen thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •