Base | Representation |
---|---|
bin | 101101111011100000001100… |
… | …011101110100111100100111 |
3 | 222111020010011202001010021011 |
4 | 231323200030131310330213 |
5 | 202434041233404323421 |
6 | 1553342010155203051 |
7 | 60356045561256166 |
oct | 5573401435647447 |
9 | 874203152033234 |
10 | 202001111011111 |
11 | 5940021000a235 |
12 | 1a7a5203446487 |
13 | 8893813a5aa79 |
14 | 37c4c97c7b3dd |
15 | 18547a487a4e1 |
hex | b7b80c774f27 |
202001111011111 has 8 divisors (see below), whose sum is σ = 202042007233920. Its totient is φ = 201960216937848.
The previous prime is 202001111011079. The next prime is 202001111011181. The reversal of 202001111011111 is 111110111100202.
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 202001111011111 - 25 = 202001111011079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202001111011091 and 202001111011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202001111011181) 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, 194564400 + ... + 195599866.
It is an arithmetic number, because the mean of its divisors is an integer number (25255250904240).
Almost surely, 2202001111011111 is an apocalyptic number.
202001111011111 is a deficient number, since it is larger than the sum of its proper divisors (40896222809).
202001111011111 is a wasteful number, since it uses less digits than its factorization.
202001111011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1074773.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 202001111011111 its reverse (111110111100202), we get a palindrome (313111222111313).
The spelling of 202001111011111 in words is "two hundred two trillion, one billion, one hundred eleven million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •