Base | Representation |
---|---|
bin | 11101001001101110110… |
… | …001000011100001111101 |
3 | 21002111220100001102212212 |
4 | 131021232301003201331 |
5 | 230310241124110323 |
6 | 4132150452310205 |
7 | 264506652334166 |
oct | 35115661034175 |
9 | 7074810042785 |
10 | 2003313113213 |
11 | 702667031885 |
12 | 284309612365 |
13 | 116bb0a882a9 |
14 | 6cd648c076d |
15 | 3719dcc0b78 |
hex | 1d26ec4387d |
2003313113213 has 4 divisors (see below), whose sum is σ = 2003315955648. Its totient is φ = 2003310270780.
The previous prime is 2003313113159. The next prime is 2003313113239. The reversal of 2003313113213 is 3123113133002.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2003313113213 - 236 = 1934593636477 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 (2003313113413) 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, 517670 + ... + 2067512.
It is an arithmetic number, because the mean of its divisors is an integer number (500828988912).
Almost surely, 22003313113213 is an apocalyptic number.
It is an amenable number.
2003313113213 is a deficient number, since it is larger than the sum of its proper divisors (2842435).
2003313113213 is a wasteful number, since it uses less digits than its factorization.
2003313113213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2842434.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 2003313113213 its reverse (3123113133002), we get a palindrome (5126426246215).
The spelling of 2003313113213 in words is "two trillion, three billion, three hundred thirteen million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.220 sec. • engine limits •