Base | Representation |
---|---|
bin | 101101101110101100101000… |
… | …011100110110100111110101 |
3 | 222101002222202010001211120121 |
4 | 231232230220130312213311 |
5 | 202330132014212102242 |
6 | 1551425432523131541 |
7 | 60235343436055336 |
oct | 5556545034664765 |
9 | 871088663054517 |
10 | 201121112222197 |
11 | 590a0a916a6362 |
12 | 1a682751673bb1 |
13 | 882b840cb190b |
14 | 3794456db428d |
15 | 183b94d258667 |
hex | b6eb287369f5 |
201121112222197 has 2 divisors, whose sum is σ = 201121112222198. Its totient is φ = 201121112222196.
The previous prime is 201121112222143. The next prime is 201121112222257. The reversal of 201121112222197 is 791222211121102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 195179871721041 + 5941240501156 = 13970679^2 + 2437466^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201121112222197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201121112223197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100560556111098 + 100560556111099.
It is an arithmetic number, because the mean of its divisors is an integer number (100560556111099).
Almost surely, 2201121112222197 is an apocalyptic number.
It is an amenable number.
201121112222197 is a deficient number, since it is larger than the sum of its proper divisors (1).
201121112222197 is an equidigital number, since it uses as much as digits as its factorization.
201121112222197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 34.
Adding to 201121112222197 its reverse (791222211121102), we get a palindrome (992343323343299).
The spelling of 201121112222197 in words is "two hundred one trillion, one hundred twenty-one billion, one hundred twelve million, two hundred twenty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •