Base | Representation |
---|---|
bin | 1010001100000010101111… |
… | …1101000000010000101111 |
3 | 1110122220100111002122200220 |
4 | 2203000223331000100233 |
5 | 2432013210100320421 |
6 | 35454044444222423 |
7 | 2234214205651611 |
oct | 243005375002057 |
9 | 43586314078626 |
10 | 11202012120111 |
11 | 362982389579a |
12 | 130b03723aa13 |
13 | 633464572137 |
14 | 2aa274988db1 |
15 | 1465cb5d73c6 |
hex | a302bf4042f |
11202012120111 has 16 divisors (see below), whose sum is σ = 16229287511040. Its totient is φ = 6846730666560.
The previous prime is 11202012120107. The next prime is 11202012120113. The reversal of 11202012120111 is 11102121020211.
It is a happy number.
It is not a de Polignac number, because 11202012120111 - 22 = 11202012120107 is a prime.
It is a super-2 number, since 2×112020121201112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202012120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3169780950 + ... + 3169784483.
It is an arithmetic number, because the mean of its divisors is an integer number (1014330469440).
Almost surely, 211202012120111 is an apocalyptic number.
11202012120111 is a deficient number, since it is larger than the sum of its proper divisors (5027275390929).
11202012120111 is a wasteful number, since it uses less digits than its factorization.
11202012120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6339565486.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11202012120111 its reverse (11102121020211), we get a palindrome (22304133140322).
The spelling of 11202012120111 in words is "eleven trillion, two hundred two billion, twelve million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •