Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …111010010111111010001 |
3 | 21002102002022011220122202 |
4 | 131020231233102333101 |
5 | 230301022331230301 |
6 | 4131450321012545 |
7 | 264440634216353 |
oct | 35105557227721 |
9 | 7072068156582 |
10 | 2002222133201 |
11 | 702157218404 |
12 | 284064184155 |
13 | 116a68a450a4 |
14 | 6cc9da4d0d3 |
15 | 3713811c66b |
hex | 1d22dbd2fd1 |
2002222133201 has 4 divisors (see below), whose sum is σ = 2002896512100. Its totient is φ = 2001547754304.
The previous prime is 2002222133161. The next prime is 2002222133237. The reversal of 2002222133201 is 1023312222002.
It is a happy number.
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 508938133201 + 1493284000000 = 713399^2 + 1222000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002222133201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002222133101) 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, 337184996 + ... + 337190933.
It is an arithmetic number, because the mean of its divisors is an integer number (500724128025).
Almost surely, 22002222133201 is an apocalyptic number.
It is an amenable number.
2002222133201 is a deficient number, since it is larger than the sum of its proper divisors (674378899).
2002222133201 is an equidigital number, since it uses as much as digits as its factorization.
2002222133201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674378898.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2002222133201 its reverse (1023312222002), we get a palindrome (3025534355203).
The spelling of 2002222133201 in words is "two trillion, two billion, two hundred twenty-two million, one hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •