Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …001000110110011010011 |
3 | 21002012101010212121022102 |
4 | 131012221321012303103 |
5 | 230232010042042321 |
6 | 4130443021431015 |
7 | 264332054312516 |
oct | 35065171066323 |
9 | 7065333777272 |
10 | 2000010112211 |
11 | 701221628291 |
12 | 28374740b46b |
13 | 1167a5695027 |
14 | 6cb2dd62d7d |
15 | 37058d28c0b |
hex | 1d1a9e46cd3 |
2000010112211 has 4 divisors (see below), whose sum is σ = 2001653507112. Its totient is φ = 1998366717312.
The previous prime is 2000010112187. The next prime is 2000010112273. The reversal of 2000010112211 is 1122110100002.
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-2000010112211 is a prime.
It is a super-2 number, since 2×20000101122112 (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 = 2000010112192 and 2000010112201.
It is not an unprimeable number, because it can be changed into a prime (2000010162211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 821695625 + ... + 821698058.
It is an arithmetic number, because the mean of its divisors is an integer number (500413376778).
Almost surely, 22000010112211 is an apocalyptic number.
2000010112211 is a deficient number, since it is larger than the sum of its proper divisors (1643394901).
2000010112211 is a wasteful number, since it uses less digits than its factorization.
2000010112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1643394900.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2000010112211 its reverse (1122110100002), we get a palindrome (3122120212213).
The spelling of 2000010112211 in words is "two trillion, ten million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •