Base | Representation |
---|---|
bin | 101101111011101001100001… |
… | …000011100000111001101011 |
3 | 222111021002000021221002101021 |
4 | 231323221201003200321223 |
5 | 202434222233222024321 |
6 | 1553350343305033311 |
7 | 60356551606232065 |
oct | 5573514103407153 |
9 | 874232007832337 |
10 | 202011120111211 |
11 | 5940448697a294 |
12 | 1a7a7137485837 |
13 | 889474a5b32c8 |
14 | 37c55672cc735 |
15 | 1854b8d434941 |
hex | b7ba610e0e6b |
202011120111211 has 8 divisors (see below), whose sum is σ = 204046278259248. Its totient is φ = 199976649180000.
The previous prime is 202011120111173. The next prime is 202011120111223. The reversal of 202011120111211 is 112111021110202.
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 202011120111211 - 29 = 202011120110699 is a prime.
It is a super-2 number, since 2×2020111201112112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202011120112211) 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, 171213325 + ... + 172389166.
It is an arithmetic number, because the mean of its divisors is an integer number (25505784782406).
Almost surely, 2202011120111211 is an apocalyptic number.
202011120111211 is a deficient number, since it is larger than the sum of its proper divisors (2035158148037).
202011120111211 is a wasteful number, since it uses less digits than its factorization.
202011120111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343608413.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 202011120111211 its reverse (112111021110202), we get a palindrome (314122141221413).
The spelling of 202011120111211 in words is "two hundred two trillion, eleven billion, one hundred twenty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •