Base | Representation |
---|---|
bin | 101101101100111011111100… |
… | …001110001111101111000111 |
3 | 222100200102102100010111211210 |
4 | 231230323330032033233013 |
5 | 202321141211421023421 |
6 | 1551254102025302503 |
7 | 60223531062433614 |
oct | 5554737416175707 |
9 | 870612370114753 |
10 | 201000111111111 |
11 | 59054739729704 |
12 | 1a663202634a33 |
13 | 88202c958b730 |
14 | 378c658b1150b |
15 | 183871a452576 |
hex | b6cefc38fbc7 |
201000111111111 has 64 divisors (see below), whose sum is σ = 291815869685760. Its totient is φ = 122323780800000.
The previous prime is 201000111111089. The next prime is 201000111111161. The reversal of 201000111111111 is 111111111000102.
It is not a de Polignac number, because 201000111111111 - 210 = 201000111110087 is a prime.
201000111111111 is a modest number, since divided by 11111111 gives 2010001 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000111111161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12826238806 + ... + 12826254476.
It is an arithmetic number, because the mean of its divisors is an integer number (4559622963840).
Almost surely, 2201000111111111 is an apocalyptic number.
201000111111111 is a deficient number, since it is larger than the sum of its proper divisors (90815758574649).
201000111111111 is a wasteful number, since it uses less digits than its factorization.
201000111111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19408.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 201000111111111 its reverse (111111111000102), we get a palindrome (312111222111213).
The spelling of 201000111111111 in words is "two hundred one trillion, one hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •