Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …010000110001111001001011 |
3 | 222100200102011100222000212102 |
4 | 231230323312100301321023 |
5 | 202321141010321041021 |
6 | 1551254044054104015 |
7 | 60223525436444216 |
oct | 5554736620617113 |
9 | 870612140860772 |
10 | 201000011112011 |
11 | 59054698238921 |
12 | 1a66319504b00b |
13 | 88202b1948477 |
14 | 378c64972077d |
15 | 183871179d00b |
hex | b6cef6431e4b |
201000011112011 has 4 divisors (see below), whose sum is σ = 201207870483312. Its totient is φ = 200792151740712.
The previous prime is 201000011112007. The next prime is 201000011112031. The reversal of 201000011112011 is 110211110000102.
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 201000011112011 - 22 = 201000011112007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201000011111983 and 201000011112001.
It is not an unprimeable number, because it can be changed into a prime (201000011112031) 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, 103929684200 + ... + 103929686133.
It is an arithmetic number, because the mean of its divisors is an integer number (50301967620828).
Almost surely, 2201000011112011 is an apocalyptic number.
201000011112011 is a deficient number, since it is larger than the sum of its proper divisors (207859371301).
201000011112011 is an equidigital number, since it uses as much as digits as its factorization.
201000011112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207859371300.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201000011112011 its reverse (110211110000102), we get a palindrome (311211121112113).
The spelling of 201000011112011 in words is "two hundred one trillion, eleven million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •