Base | Representation |
---|---|
bin | 100000000000111011100… |
… | …001111010000111101111 |
3 | 21210022122022112020221102 |
4 | 200000323201322013233 |
5 | 242021121113000421 |
6 | 4402402014353315 |
7 | 314642411311235 |
oct | 40007341720757 |
9 | 7708568466842 |
10 | 2200022000111 |
11 | 77902a078aa1 |
12 | 2b6466abb83b |
13 | 12c5cc2b7160 |
14 | 786a585a955 |
15 | 3c36334a60b |
hex | 2003b87a1ef |
2200022000111 has 4 divisors (see below), whose sum is σ = 2369254461672. Its totient is φ = 2030789538552.
The previous prime is 2200022000083. The next prime is 2200022000123. The reversal of 2200022000111 is 1110002200022.
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 2200022000111 - 218 = 2200021737967 is a prime.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 2200022000092 and 2200022000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200022003111) 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, 84616230761 + ... + 84616230786.
It is an arithmetic number, because the mean of its divisors is an integer number (592313615418).
Almost surely, 22200022000111 is an apocalyptic number.
2200022000111 is a deficient number, since it is larger than the sum of its proper divisors (169232461561).
2200022000111 is a wasteful number, since it uses less digits than its factorization.
2200022000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169232461560.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2200022000111 its reverse (1110002200022), we get a palindrome (3310024200133).
The spelling of 2200022000111 in words is "two trillion, two hundred billion, twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •