Base | Representation |
---|---|
bin | 11101000111110001000… |
… | …000110000111001111101 |
3 | 21002022110022001221000022 |
4 | 131013301000300321331 |
5 | 230241431021131023 |
6 | 4131201243541525 |
7 | 264403453255136 |
oct | 35076100607175 |
9 | 7068408057008 |
10 | 2001203302013 |
11 | 701784102463 |
12 | 283a1ab2a8a5 |
13 | 1169359437b6 |
14 | 6cc045dcc8d |
15 | 370c896b7c8 |
hex | 1d1f1030e7d |
2001203302013 has 4 divisors (see below), whose sum is σ = 2001207074400. Its totient is φ = 2001199529628.
The previous prime is 2001203301983. The next prime is 2001203302079. The reversal of 2001203302013 is 3102033021002.
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 a de Polignac number, because none of the positive numbers 2k-2001203302013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001203301982 and 2001203302000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001203304013) 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, 928313 + ... + 2205486.
It is an arithmetic number, because the mean of its divisors is an integer number (500301768600).
Almost surely, 22001203302013 is an apocalyptic number.
It is an amenable number.
2001203302013 is a deficient number, since it is larger than the sum of its proper divisors (3772387).
2001203302013 is an equidigital number, since it uses as much as digits as its factorization.
2001203302013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3772386.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 2001203302013 its reverse (3102033021002), we get a palindrome (5103236323015).
The spelling of 2001203302013 in words is "two trillion, one billion, two hundred three million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •