Base | Representation |
---|---|
bin | 11101001001011101010… |
… | …110110001100100010101 |
3 | 21002111010222102010021120 |
4 | 131021131112301210111 |
5 | 230304141334324341 |
6 | 4132101455434153 |
7 | 264466504450656 |
oct | 35113526614425 |
9 | 7074128363246 |
10 | 2003021011221 |
11 | 70252716227a |
12 | 284247825959 |
13 | 116b653c4389 |
14 | 6cd37ba552d |
15 | 37183322066 |
hex | 1d25d5b1915 |
2003021011221 has 4 divisors (see below), whose sum is σ = 2670694681632. Its totient is φ = 1335347340812.
The previous prime is 2003021011193. The next prime is 2003021011297. The reversal of 2003021011221 is 1221101203002.
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 2003021011221 - 211 = 2003021009173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2003021011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003028011221) 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, 333836835201 + ... + 333836835206.
It is an arithmetic number, because the mean of its divisors is an integer number (667673670408).
Almost surely, 22003021011221 is an apocalyptic number.
It is an amenable number.
2003021011221 is a deficient number, since it is larger than the sum of its proper divisors (667673670411).
2003021011221 is an equidigital number, since it uses as much as digits as its factorization.
2003021011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667673670410.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2003021011221 its reverse (1221101203002), we get a palindrome (3224122214223).
The spelling of 2003021011221 in words is "two trillion, three billion, twenty-one million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •