Base | Representation |
---|---|
bin | 11101010000111000111… |
… | …101000000011100010110 |
3 | 21010020202001200110221112 |
4 | 131100320331000130112 |
5 | 230422012023224342 |
6 | 4135501333415022 |
7 | 265201313520512 |
oct | 35207075003426 |
9 | 7106661613845 |
10 | 2011000211222 |
11 | 705951213342 |
12 | 2858b3a9a472 |
13 | 117837533bb2 |
14 | 6d4937b7142 |
15 | 3749daae682 |
hex | 1d438f40716 |
2011000211222 has 4 divisors (see below), whose sum is σ = 3016500316836. Its totient is φ = 1005500105610.
The previous prime is 2011000211191. The next prime is 2011000211249. The reversal of 2011000211222 is 2221120001102.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×20110002112222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011000211197 and 2011000211206.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 502750052804 + ... + 502750052807.
It is an arithmetic number, because the mean of its divisors is an integer number (754125079209).
Almost surely, 22011000211222 is an apocalyptic number.
2011000211222 is a deficient number, since it is larger than the sum of its proper divisors (1005500105614).
2011000211222 is a wasteful number, since it uses less digits than its factorization.
2011000211222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005500105613.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2011000211222 its reverse (2221120001102), we get a palindrome (4232120212324).
It can be divided in two parts, 2011000 and 211222, that added together give a palindrome (2222222).
The spelling of 2011000211222 in words is "two trillion, eleven billion, two hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •