Base | Representation |
---|---|
bin | 101101101100111011111100… |
… | …001110100111111000011011 |
3 | 222100200102102100022112111202 |
4 | 231230323330032213320123 |
5 | 202321141211432210021 |
6 | 1551254102031344415 |
7 | 60223531063325141 |
oct | 5554737416477033 |
9 | 870612370275452 |
10 | 201000111210011 |
11 | 59054739796a43 |
12 | 1a66320268210b |
13 | 88202c95c4759 |
14 | 378c658b39591 |
15 | 183871a471a0b |
hex | b6cefc3a7e1b |
201000111210011 has 4 divisors (see below), whose sum is σ = 201312708584232. Its totient is φ = 200687513835792.
The previous prime is 201000111209981. The next prime is 201000111210013. The reversal of 201000111210011 is 110012111000102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201000111210011 - 222 = 201000107015707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201000111209974 and 201000111210001.
It is not an unprimeable number, because it can be changed into a prime (201000111210013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 156298686146 + ... + 156298687431.
It is an arithmetic number, because the mean of its divisors is an integer number (50328177146058).
Almost surely, 2201000111210011 is an apocalyptic number.
201000111210011 is a deficient number, since it is larger than the sum of its proper divisors (312597374221).
201000111210011 is an equidigital number, since it uses as much as digits as its factorization.
201000111210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 312597374220.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201000111210011 its reverse (110012111000102), we get a palindrome (311012222210113).
The spelling of 201000111210011 in words is "two hundred one trillion, one hundred eleven million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •