Base | Representation |
---|---|
bin | 11101000110111100011… |
… | …100101110110101001111 |
3 | 21002020011211200202021010 |
4 | 131012330130232311033 |
5 | 230233124242103403 |
6 | 4130533542340303 |
7 | 264342554465106 |
oct | 35067434566517 |
9 | 7066154622233 |
10 | 2000321441103 |
11 | 70137133a297 |
12 | 28381372a693 |
13 | 11682502b4cb |
14 | 6cb5d44503d |
15 | 37076324603 |
hex | 1d1bc72ed4f |
2000321441103 has 16 divisors (see below), whose sum is σ = 2669475292160. Its totient is φ = 1332358144704.
The previous prime is 2000321441089. The next prime is 2000321441117. The reversal of 2000321441103 is 3011441230002.
It is an interprime number because it is at equal distance from previous prime (2000321441089) and next prime (2000321441117).
It is not a de Polignac number, because 2000321441103 - 28 = 2000321440847 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000321441103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000321441803) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15389058 + ... + 15518496.
It is an arithmetic number, because the mean of its divisors is an integer number (166842205760).
Almost surely, 22000321441103 is an apocalyptic number.
2000321441103 is a deficient number, since it is larger than the sum of its proper divisors (669153851057).
2000321441103 is a wasteful number, since it uses less digits than its factorization.
2000321441103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133998.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2000321441103 its reverse (3011441230002), we get a palindrome (5011762671105).
The spelling of 2000321441103 in words is "two trillion, three hundred twenty-one million, four hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •