Base | Representation |
---|---|
bin | 11001000011101001101110… |
… | …001101111010010000010011 |
3 | 112110012012221020000200201012 |
4 | 121003221232031322100103 |
5 | 103421022420211133021 |
6 | 1030214053253201135 |
7 | 32132561160405044 |
oct | 3103515615722023 |
9 | 473165836020635 |
10 | 110202120021011 |
11 | 32128502874577 |
12 | 10439aab0301ab |
13 | 496502789b325 |
14 | 1d2db4d8008cb |
15 | cb1923d5635b |
hex | 643a6e37a413 |
110202120021011 has 4 divisors (see below), whose sum is σ = 112069952563800. Its totient is φ = 108334287478224.
The previous prime is 110202120020999. The next prime is 110202120021061. The reversal of 110202120021011 is 110120021202011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110202120021011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110202120021061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 933916271306 + ... + 933916271423.
It is an arithmetic number, because the mean of its divisors is an integer number (28017488140950).
Almost surely, 2110202120021011 is an apocalyptic number.
110202120021011 is a deficient number, since it is larger than the sum of its proper divisors (1867832542789).
110202120021011 is an equidigital number, since it uses as much as digits as its factorization.
110202120021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1867832542788.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110202120021011 its reverse (110120021202011), we get a palindrome (220322141223022).
The spelling of 110202120021011 in words is "one hundred ten trillion, two hundred two billion, one hundred twenty million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •