Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …001000011010101001100111 |
3 | 222101001221022201112100112102 |
4 | 231232202120020122221213 |
5 | 202324441441324323142 |
6 | 1551420412134442315 |
7 | 60234503532240044 |
oct | 5556423010325147 |
9 | 871057281470472 |
10 | 201110101011047 |
11 | 59097351100458 |
12 | 1a680599b0339b |
13 | 882a7a7960367 |
14 | 3793ad08261cb |
15 | 183b506702532 |
hex | b6e89821aa67 |
201110101011047 has 2 divisors, whose sum is σ = 201110101011048. Its totient is φ = 201110101011046.
The previous prime is 201110101011041. The next prime is 201110101011143. The reversal of 201110101011047 is 740110101011102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201110101011047 - 216 = 201110100945511 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201110101011041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555050505523 + 100555050505524.
It is an arithmetic number, because the mean of its divisors is an integer number (100555050505524).
Almost surely, 2201110101011047 is an apocalyptic number.
201110101011047 is a deficient number, since it is larger than the sum of its proper divisors (1).
201110101011047 is an equidigital number, since it uses as much as digits as its factorization.
201110101011047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 201110101011047 its reverse (740110101011102), we get a palindrome (941220202022149).
The spelling of 201110101011047 in words is "two hundred one trillion, one hundred ten billion, one hundred one million, eleven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •