Base | Representation |
---|---|
bin | 11110101111001000111… |
… | …011111100100010101011 |
3 | 21110220221212010111011202 |
4 | 132233020323330202223 |
5 | 234101241211200021 |
6 | 4254155322314415 |
7 | 305413200422201 |
oct | 36571073744253 |
9 | 7426855114152 |
10 | 2112200100011 |
11 | 744862989671 |
12 | 2a1437658a0b |
13 | 1242447c92b1 |
14 | 74333d39071 |
15 | 39e23311a0b |
hex | 1ebc8efc8ab |
2112200100011 has 8 divisors (see below), whose sum is σ = 2226756898464. Its totient is φ = 1999536802560.
The previous prime is 2112200099983. The next prime is 2112200100071. The reversal of 2112200100011 is 1100010022112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2112200100011 - 214 = 2112200083627 is a prime.
It is a super-2 number, since 2×21122001000112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2112200099965 and 2112200100001.
It is not an unprimeable number, because it can be changed into a prime (2112200100071) 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, 473372960 + ... + 473377421.
It is an arithmetic number, because the mean of its divisors is an integer number (278344612308).
Almost surely, 22112200100011 is an apocalyptic number.
2112200100011 is a deficient number, since it is larger than the sum of its proper divisors (114556798453).
2112200100011 is an equidigital number, since it uses as much as digits as its factorization.
2112200100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946750501.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2112200100011 its reverse (1100010022112), we get a palindrome (3212210122123).
The spelling of 2112200100011 in words is "two trillion, one hundred twelve billion, two hundred million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •