Base | Representation |
---|---|
bin | 101101111011100000010010… |
… | …111101100110000011011011 |
3 | 222111020010110100010102200011 |
4 | 231323200102331212003123 |
5 | 202434041444310031021 |
6 | 1553342025051222351 |
7 | 60356051353546003 |
oct | 5573402275460333 |
9 | 874203410112604 |
10 | 202001220002011 |
11 | 59400266591761 |
12 | 1a7a5233a479b7 |
13 | 88938304cba21 |
14 | 37c4ca852d003 |
15 | 18547ae208de1 |
hex | b7b812f660db |
202001220002011 has 4 divisors (see below), whose sum is σ = 203788841418072. Its totient is φ = 200213598585952.
The previous prime is 202001220001979. The next prime is 202001220002041. The reversal of 202001220002011 is 110200022100202.
It is a happy number.
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 202001220002011 - 25 = 202001220001979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202001220001982 and 202001220002000.
It is not an unprimeable number, because it can be changed into a prime (202001220002041) 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, 893810707861 + ... + 893810708086.
It is an arithmetic number, because the mean of its divisors is an integer number (50947210354518).
Almost surely, 2202001220002011 is an apocalyptic number.
202001220002011 is a deficient number, since it is larger than the sum of its proper divisors (1787621416061).
202001220002011 is a wasteful number, since it uses less digits than its factorization.
202001220002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1787621416060.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 202001220002011 its reverse (110200022100202), we get a palindrome (312201242102213).
The spelling of 202001220002011 in words is "two hundred two trillion, one billion, two hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •