Base | Representation |
---|---|
bin | 101101111011100001000001… |
… | …100001010100101101101111 |
3 | 222111020012110202221100021011 |
4 | 231323201001201110231233 |
5 | 202434100044241320421 |
6 | 1553342234353250051 |
7 | 60356106620131153 |
oct | 5573410141245557 |
9 | 874205422840234 |
10 | 202002001120111 |
11 | 594006274a6305 |
12 | 1a7a5411563927 |
13 | 88939262a039a |
14 | 37c4d40181063 |
15 | 1854807aa14e1 |
hex | b7b841854b6f |
202002001120111 has 4 divisors (see below), whose sum is σ = 202002159874824. Its totient is φ = 202001842365400.
The previous prime is 202002001120067. The next prime is 202002001120121. The reversal of 202002001120111 is 111021100200202.
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 202002001120111 - 211 = 202002001118063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202002001120091 and 202002001120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202002001120121) 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, 77453185 + ... + 80018746.
It is an arithmetic number, because the mean of its divisors is an integer number (50500539968706).
Almost surely, 2202002001120111 is an apocalyptic number.
202002001120111 is a deficient number, since it is larger than the sum of its proper divisors (158754713).
202002001120111 is a wasteful number, since it uses less digits than its factorization.
202002001120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158754712.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 202002001120111 its reverse (111021100200202), we get a palindrome (313023101320313).
The spelling of 202002001120111 in words is "two hundred two trillion, two billion, one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •