Base | Representation |
---|---|
bin | 11101000111111000001… |
… | …001011111110111001101 |
3 | 21002022202122100211200202 |
4 | 131013320021133313031 |
5 | 230242202144011023 |
6 | 4131221202103245 |
7 | 264406436043164 |
oct | 35077011376715 |
9 | 7068678324622 |
10 | 2001323032013 |
11 | 70183574a378 |
12 | 283a5304ab25 |
13 | 1169546a4856 |
14 | 6cc164883db |
15 | 370d421c128 |
hex | 1d1f825fdcd |
2001323032013 has 4 divisors (see below), whose sum is σ = 2002284746268. Its totient is φ = 2000361317760.
The previous prime is 2001323032001. The next prime is 2001323032019. The reversal of 2001323032013 is 3102303231002.
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 779473562884 + 1221849469129 = 882878^2 + 1105373^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001323032013 - 210 = 2001323030989 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 (2001323032019) 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, 480854006 + ... + 480858167.
It is an arithmetic number, because the mean of its divisors is an integer number (500571186567).
Almost surely, 22001323032013 is an apocalyptic number.
It is an amenable number.
2001323032013 is a deficient number, since it is larger than the sum of its proper divisors (961714255).
2001323032013 is an equidigital number, since it uses as much as digits as its factorization.
2001323032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961714254.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2001323032013 its reverse (3102303231002), we get a palindrome (5103626263015).
The spelling of 2001323032013 in words is "two trillion, one billion, three hundred twenty-three million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •