Base | Representation |
---|---|
bin | 100000000001001100110… |
… | …001000111110111000111 |
3 | 21210100101110201012021201 |
4 | 200001030301013313013 |
5 | 242022214131414343 |
6 | 4402450425123331 |
7 | 314652522423202 |
oct | 40011461076707 |
9 | 7710343635251 |
10 | 2200311201223 |
11 | 779168347083 |
12 | 2b6527929547 |
13 | 12c6471a3885 |
14 | 786d201c939 |
15 | 3c37d92494d |
hex | 2004cc47dc7 |
2200311201223 has 16 divisors (see below), whose sum is σ = 2316264652800. Its totient is φ = 2086080042816.
The previous prime is 2200311201217. The next prime is 2200311201233. The reversal of 2200311201223 is 3221021130022.
It is a cyclic number.
It is not a de Polignac number, because 2200311201223 - 229 = 2199774330311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2200311201223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200311201233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2705086 + ... + 3423172.
It is an arithmetic number, because the mean of its divisors is an integer number (144766540800).
Almost surely, 22200311201223 is an apocalyptic number.
2200311201223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
2200311201223 is a deficient number, since it is larger than the sum of its proper divisors (115953451577).
2200311201223 is a wasteful number, since it uses less digits than its factorization.
2200311201223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 719286.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2200311201223 its reverse (3221021130022), we get a palindrome (5421332331245).
The spelling of 2200311201223 in words is "two trillion, two hundred billion, three hundred eleven million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •