Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …101101111101001011111 |
3 | 21002101112122210121022211 |
4 | 131020201031233221133 |
5 | 230300110033323403 |
6 | 4131413413221251 |
7 | 264432503213446 |
oct | 35104115575137 |
9 | 7071478717284 |
10 | 2002012011103 |
11 | 702059651585 |
12 | 284005931827 |
13 | 116a343557a0 |
14 | 6cc7db93d5d |
15 | 3712496406d |
hex | 1d22136fa5f |
2002012011103 has 8 divisors (see below), whose sum is σ = 2158619975568. Its totient is φ = 1845776481024.
The previous prime is 2002012011073. The next prime is 2002012011107. The reversal of 2002012011103 is 3011102102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002012011103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002012011107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93097426 + ... + 93118927.
It is an arithmetic number, because the mean of its divisors is an integer number (269827496946).
Almost surely, 22002012011103 is an apocalyptic number.
2002012011103 is a deficient number, since it is larger than the sum of its proper divisors (156607964465).
2002012011103 is a wasteful number, since it uses less digits than its factorization.
2002012011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186217193.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2002012011103 its reverse (3011102102002), we get a palindrome (5013114113105).
The spelling of 2002012011103 in words is "two trillion, two billion, twelve million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •