Base | Representation |
---|---|
bin | 11101001001101001111… |
… | …000001101100000100011 |
3 | 21002111200121201220000222 |
4 | 131021221320031200203 |
5 | 230310104130244021 |
6 | 4132134402433255 |
7 | 264504635266325 |
oct | 35115170154043 |
9 | 7074617656028 |
10 | 2003231103011 |
11 | 702624808356 |
12 | 2842a606282b |
13 | 116b99aa2c48 |
14 | 6cd57a53615 |
15 | 371969c16ab |
hex | 1d269e0d823 |
2003231103011 has 4 divisors (see below), whose sum is σ = 2018522943624. Its totient is φ = 1987939262400.
The previous prime is 2003231103001. The next prime is 2003231103043. The reversal of 2003231103011 is 1103011323002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2003231103011 - 214 = 2003231086627 is a prime.
It is a super-2 number, since 2×20032311030112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2003231103001) 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, 7645920110 + ... + 7645920371.
It is an arithmetic number, because the mean of its divisors is an integer number (504630735906).
Almost surely, 22003231103011 is an apocalyptic number.
2003231103011 is a deficient number, since it is larger than the sum of its proper divisors (15291840613).
2003231103011 is a wasteful number, since it uses less digits than its factorization.
2003231103011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15291840612.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2003231103011 its reverse (1103011323002), we get a palindrome (3106242426013).
The spelling of 2003231103011 in words is "two trillion, three billion, two hundred thirty-one million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •