Base | Representation |
---|---|
bin | 101101101100111100000010… |
… | …001111001011101110001111 |
3 | 222100200102200101000012222011 |
4 | 231230330002033023232033 |
5 | 202321141413234120421 |
6 | 1551254120032202051 |
7 | 60223533426233140 |
oct | 5554740217135617 |
9 | 870612611005864 |
10 | 201000212020111 |
11 | 59054790691079 |
12 | 1a663230399327 |
13 | 882031445cbba |
14 | 378c66829bac7 |
15 | 18387242364e1 |
hex | b6cf023cbb8f |
201000212020111 has 8 divisors (see below), whose sum is σ = 229714635616544. Its totient is φ = 172285815322080.
The previous prime is 201000212020037. The next prime is 201000212020117. The reversal of 201000212020111 is 111020212000102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201000212020111 - 229 = 200999675149199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201000212020091 and 201000212020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000212020117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13239301 + ... + 24026641.
It is an arithmetic number, because the mean of its divisors is an integer number (28714329452068).
Almost surely, 2201000212020111 is an apocalyptic number.
201000212020111 is a deficient number, since it is larger than the sum of its proper divisors (28714423596433).
201000212020111 is a wasteful number, since it uses less digits than its factorization.
201000212020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13449201.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201000212020111 its reverse (111020212000102), we get a palindrome (312020424020213).
The spelling of 201000212020111 in words is "two hundred one trillion, two hundred twelve million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •