Base | Representation |
---|---|
bin | 101101111101000110100010… |
… | …011111110100111001101011 |
3 | 222111121121211020220000001012 |
4 | 231331012202133310321223 |
5 | 202442341313042100021 |
6 | 1553504302423014135 |
7 | 60400016022643520 |
oct | 5575064237647153 |
9 | 874547736800035 |
10 | 202111002300011 |
11 | 59442881859062 |
12 | 1a80257189a34b |
13 | 88a0ca788417c |
14 | 37ca320843147 |
15 | 185758714c35b |
hex | b7d1a27f4e6b |
202111002300011 has 8 divisors (see below), whose sum is σ = 231018586302720. Its totient is φ = 173212064215848.
The previous prime is 202111002299993. The next prime is 202111002300059. The reversal of 202111002300011 is 110003200111202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202111002300011 - 234 = 202093822430827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202111002300211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2161429541 + ... + 2161523046.
It is an arithmetic number, because the mean of its divisors is an integer number (28877323287840).
Almost surely, 2202111002300011 is an apocalyptic number.
202111002300011 is a deficient number, since it is larger than the sum of its proper divisors (28907584002709).
202111002300011 is an equidigital number, since it uses as much as digits as its factorization.
202111002300011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4322959273.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 202111002300011 its reverse (110003200111202), we get a palindrome (312114202411213).
The spelling of 202111002300011 in words is "two hundred two trillion, one hundred eleven billion, two million, three hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •