Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …010010110100011111001 |
3 | 21002012122011220102112102 |
4 | 131012233322112203321 |
5 | 230232211420232301 |
6 | 4130501030153145 |
7 | 264334421600132 |
oct | 35065772264371 |
9 | 7065564812472 |
10 | 2000111102201 |
11 | 701273635593 |
12 | 2837751b27b5 |
13 | 1167c0594314 |
14 | 6cb3d530c89 |
15 | 37062b26b6b |
hex | 1d1afe968f9 |
2000111102201 has 4 divisors (see below), whose sum is σ = 2105380107600. Its totient is φ = 1894842096804.
The previous prime is 2000111102189. The next prime is 2000111102251. The reversal of 2000111102201 is 1022011110002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000111102201 is a prime.
It is a super-2 number, since 2×20001111022012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000111102251) 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, 52634502671 + ... + 52634502708.
It is an arithmetic number, because the mean of its divisors is an integer number (526345026900).
Almost surely, 22000111102201 is an apocalyptic number.
It is an amenable number.
2000111102201 is a deficient number, since it is larger than the sum of its proper divisors (105269005399).
2000111102201 is a wasteful number, since it uses less digits than its factorization.
2000111102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105269005398.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2000111102201 its reverse (1022011110002), we get a palindrome (3022122212203).
The spelling of 2000111102201 in words is "two trillion, one hundred eleven million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •