Base | Representation |
---|---|
bin | 101101101110100110010100… |
… | …110011101011111000010001 |
3 | 222101002100021011100002100001 |
4 | 231232212110303223320101 |
5 | 202330024132043242431 |
6 | 1551422352531330001 |
7 | 60235013555661151 |
oct | 5556462463537021 |
9 | 871070234302301 |
10 | 201114340212241 |
11 | 59099127012015 |
12 | 1a681381750901 |
13 | 882b001cb3131 |
14 | 3793db3844761 |
15 | 183b6a3976e61 |
hex | b6e994cebe11 |
201114340212241 has 2 divisors, whose sum is σ = 201114340212242. Its totient is φ = 201114340212240.
The previous prime is 201114340212239. The next prime is 201114340212259. The reversal of 201114340212241 is 142212043411102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141769981158400 + 59344359053841 = 11906720^2 + 7703529^2 .
It is a cyclic number.
It is not a de Polignac number, because 201114340212241 - 21 = 201114340212239 is a prime.
Together with 201114340212239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (201114340242241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100557170106120 + 100557170106121.
It is an arithmetic number, because the mean of its divisors is an integer number (100557170106121).
Almost surely, 2201114340212241 is an apocalyptic number.
It is an amenable number.
201114340212241 is a deficient number, since it is larger than the sum of its proper divisors (1).
201114340212241 is an equidigital number, since it uses as much as digits as its factorization.
201114340212241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 201114340212241 its reverse (142212043411102), we get a palindrome (343326383623343).
The spelling of 201114340212241 in words is "two hundred one trillion, one hundred fourteen billion, three hundred forty million, two hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •