Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …111000111100000100011 |
3 | 21002012100112002221002102 |
4 | 131012221113013200203 |
5 | 230232000301432321 |
6 | 4130442102441015 |
7 | 264331615503035 |
oct | 35065127074043 |
9 | 7065315087072 |
10 | 2000001202211 |
11 | 7012175a2051 |
12 | 28374443316b |
13 | 1167a389563c |
14 | 6cb2cac3c55 |
15 | 37058168c0b |
hex | 1d1a95c7823 |
2000001202211 has 4 divisors (see below), whose sum is σ = 2105264423400. Its totient is φ = 1894737981024.
The previous prime is 2000001202181. The next prime is 2000001202223. The reversal of 2000001202211 is 1122021000002.
It is a happy number.
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 2000001202211 - 234 = 1982821333027 is a prime.
It is a super-2 number, since 2×20000012022112 (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 = 2000001202192 and 2000001202201.
It is not an unprimeable number, because it can be changed into a prime (2000001202291) 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, 52631610566 + ... + 52631610603.
It is an arithmetic number, because the mean of its divisors is an integer number (526316105850).
Almost surely, 22000001202211 is an apocalyptic number.
2000001202211 is a deficient number, since it is larger than the sum of its proper divisors (105263221189).
2000001202211 is a wasteful number, since it uses less digits than its factorization.
2000001202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105263221188.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2000001202211 its reverse (1122021000002), we get a palindrome (3122022202213).
The spelling of 2000001202211 in words is "two trillion, one million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •