Base | Representation |
---|---|
bin | 11101001000100000101… |
… | …000010111000110000001 |
3 | 21002101111222100201101111 |
4 | 131020200220113012001 |
5 | 230300100031224301 |
6 | 4131412423203321 |
7 | 264432324006346 |
oct | 35104050270601 |
9 | 7071458321344 |
10 | 2002002211201 |
11 | 702054068793 |
12 | 2840025a6541 |
13 | 116a32304025 |
14 | 6cc7c7627cd |
15 | 37123b7a551 |
hex | 1d220a17181 |
2002002211201 has 4 divisors (see below), whose sum is σ = 2119767047172. Its totient is φ = 1884237375232.
The previous prime is 2002002211129. The next prime is 2002002211207. The reversal of 2002002211201 is 1021122002002.
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 1470583080976 + 531419130225 = 1212676^2 + 728985^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002002211201 - 223 = 2001993822593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002002211207) 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, 58882417960 + ... + 58882417993.
It is an arithmetic number, because the mean of its divisors is an integer number (529941761793).
Almost surely, 22002002211201 is an apocalyptic number.
It is an amenable number.
2002002211201 is a deficient number, since it is larger than the sum of its proper divisors (117764835971).
2002002211201 is a wasteful number, since it uses less digits than its factorization.
2002002211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117764835970.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2002002211201 its reverse (1021122002002), we get a palindrome (3023124213203).
The spelling of 2002002211201 in words is "two trillion, two billion, two million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •