Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …110011011100101010101111 |
3 | 222100200102012000001202101201 |
4 | 231230323312303130222233 |
5 | 202321141020132400421 |
6 | 1551254045020550331 |
7 | 60223525606625146 |
oct | 5554736663345257 |
9 | 870612160052351 |
10 | 201000020200111 |
11 | 590546a2385950 |
12 | 1a6631980b23a7 |
13 | 88202b37aac42 |
14 | 378c64aa0875d |
15 | 1838712495b91 |
hex | b6cef6cdcaaf |
201000020200111 has 4 divisors (see below), whose sum is σ = 219272749309224. Its totient is φ = 182727291091000.
The previous prime is 201000020200093. The next prime is 201000020200123. The reversal of 201000020200111 is 111002020000102.
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 201000020200111 - 29 = 201000020199599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000020200181) 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 3 ways as a sum of consecutive naturals, for example, 9136364554540 + ... + 9136364554561.
It is an arithmetic number, because the mean of its divisors is an integer number (54818187327306).
Almost surely, 2201000020200111 is an apocalyptic number.
201000020200111 is a deficient number, since it is larger than the sum of its proper divisors (18272729109113).
201000020200111 is a wasteful number, since it uses less digits than its factorization.
201000020200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18272729109112.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201000020200111 its reverse (111002020000102), we get a palindrome (312002040200213).
The spelling of 201000020200111 in words is "two hundred one trillion, twenty million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •