Base | Representation |
---|---|
bin | 101101101110011001001010… |
… | …000111000111010000001011 |
3 | 222101000222202212000011212012 |
4 | 231232121022013013100023 |
5 | 202324311203220041021 |
6 | 1551412054003010135 |
7 | 60234003323054066 |
oct | 5556311207072013 |
9 | 871028685004765 |
10 | 201100202112011 |
11 | 5909313146a064 |
12 | 1a67a69696994b |
13 | 882988abb0857 |
14 | 3793431c9d8dd |
15 | 183b12766535b |
hex | b6e64a1c740b |
201100202112011 has 4 divisors (see below), whose sum is σ = 202945158094800. Its totient is φ = 199255246129224.
The previous prime is 201100202111959. The next prime is 201100202112077. The reversal of 201100202112011 is 110211202001102.
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 201100202112011 - 26 = 201100202111947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201100202112911) 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, 922477991231 + ... + 922477991448.
It is an arithmetic number, because the mean of its divisors is an integer number (50736289523700).
Almost surely, 2201100202112011 is an apocalyptic number.
201100202112011 is a deficient number, since it is larger than the sum of its proper divisors (1844955982789).
201100202112011 is a wasteful number, since it uses less digits than its factorization.
201100202112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1844955982788.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201100202112011 its reverse (110211202001102), we get a palindrome (311311404113113).
The spelling of 201100202112011 in words is "two hundred one trillion, one hundred billion, two hundred two million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •