Base | Representation |
---|---|
bin | 11101001000101110011… |
… | …001100001000101101001 |
3 | 21002102010002000012211021 |
4 | 131020232121201011221 |
5 | 230301033144413001 |
6 | 4131451354132441 |
7 | 264441130254115 |
oct | 35105631410551 |
9 | 7072102005737 |
10 | 2002233201001 |
11 | 702162497850 |
12 | 284067a21121 |
13 | 116a6b11b997 |
14 | 6cca12d0745 |
15 | 371390a6ba1 |
hex | 1d22e661169 |
2002233201001 has 4 divisors (see below), whose sum is σ = 2184254401104. Its totient is φ = 1820212000900.
The previous prime is 2002233200921. The next prime is 2002233201011. The reversal of 2002233201001 is 1001023322002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2002233201001 - 29 = 2002233200489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002233201011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91010600035 + ... + 91010600056.
It is an arithmetic number, because the mean of its divisors is an integer number (546063600276).
Almost surely, 22002233201001 is an apocalyptic number.
It is an amenable number.
2002233201001 is a deficient number, since it is larger than the sum of its proper divisors (182021200103).
2002233201001 is a wasteful number, since it uses less digits than its factorization.
2002233201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182021200102.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 2002233201001 its reverse (1001023322002), we get a palindrome (3003256523003).
The spelling of 2002233201001 in words is "two trillion, two billion, two hundred thirty-three million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •