Base | Representation |
---|---|
bin | 100000000001000000001… |
… | …111010100001011110011 |
3 | 21210022211211012111011111 |
4 | 200001000033110023303 |
5 | 242021301324342321 |
6 | 4402413520054151 |
7 | 314644361021224 |
oct | 40010017241363 |
9 | 7708754174144 |
10 | 2200101012211 |
11 | 77906a734a53 |
12 | 2b6489464357 |
13 | 12c61278c98b |
14 | 786b214724b |
15 | 3c36a2565e1 |
hex | 200403d42f3 |
2200101012211 has 4 divisors (see below), whose sum is σ = 2200221722800. Its totient is φ = 2199980301624.
The previous prime is 2200101012139. The next prime is 2200101012269. The reversal of 2200101012211 is 1122101010022.
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 2200101012211 - 213 = 2200101004019 is a prime.
It is a super-2 number, since 2×22001010122112 (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 = 2200101012191 and 2200101012200.
It is not an unprimeable number, because it can be changed into a prime (2200101012911) 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, 60327951 + ... + 60364408.
It is an arithmetic number, because the mean of its divisors is an integer number (550055430700).
Almost surely, 22200101012211 is an apocalyptic number.
2200101012211 is a deficient number, since it is larger than the sum of its proper divisors (120710589).
2200101012211 is a wasteful number, since it uses less digits than its factorization.
2200101012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120710588.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2200101012211 its reverse (1122101010022), we get a palindrome (3322202022233).
The spelling of 2200101012211 in words is "two trillion, two hundred billion, one hundred one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •