Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …011101101110111101101 |
3 | 21002102000202221202210201 |
4 | 131020230123231313231 |
5 | 230301001224120323 |
6 | 4131444215233501 |
7 | 264440250044011 |
oct | 35105433556755 |
9 | 7072022852721 |
10 | 2002200223213 |
11 | 702145913083 |
12 | 284058978891 |
13 | 116a643434b8 |
14 | 6cc9ab88541 |
15 | 371362408ad |
hex | 1d22c6edded |
2002200223213 has 4 divisors (see below), whose sum is σ = 2007193241628. Its totient is φ = 1997207204800.
The previous prime is 2002200223187. The next prime is 2002200223229. The reversal of 2002200223213 is 3123220022002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1582810577604 + 419389645609 = 1258098^2 + 647603^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002200223213 - 25 = 2002200223181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002200220213) 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, 2496508606 + ... + 2496509407.
It is an arithmetic number, because the mean of its divisors is an integer number (501798310407).
Almost surely, 22002200223213 is an apocalyptic number.
It is an amenable number.
2002200223213 is a deficient number, since it is larger than the sum of its proper divisors (4993018415).
2002200223213 is an equidigital number, since it uses as much as digits as its factorization.
2002200223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4993018414.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 2002200223213 its reverse (3123220022002), we get a palindrome (5125420245215).
The spelling of 2002200223213 in words is "two trillion, two billion, two hundred million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •