Base | Representation |
---|---|
bin | 100001101000010011100… |
… | …010011100000010100111 |
3 | 22011221010222020001021120 |
4 | 201220103202130002213 |
5 | 300330432132400403 |
6 | 4525400143145023 |
7 | 325652143404606 |
oct | 41502342340247 |
9 | 8157128201246 |
10 | 2311020200103 |
11 | 81110972257a |
12 | 313a83ba5173 |
13 | 139c0b540b34 |
14 | 7dbd543da3d |
15 | 401acdbae53 |
hex | 21a1389c0a7 |
2311020200103 has 8 divisors (see below), whose sum is σ = 3180758985216. Its totient is φ = 1490980774200.
The previous prime is 2311020200081. The next prime is 2311020200123. The reversal of 2311020200103 is 3010020201132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2311020200103 - 26 = 2311020200039 is a prime.
It is a super-2 number, since 2×23110202001032 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2311020200123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12424839693 + ... + 12424839878.
It is an arithmetic number, because the mean of its divisors is an integer number (397594873152).
Almost surely, 22311020200103 is an apocalyptic number.
2311020200103 is a deficient number, since it is larger than the sum of its proper divisors (869738785113).
2311020200103 is a wasteful number, since it uses less digits than its factorization.
2311020200103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24849679605.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 2311020200103 its reverse (3010020201132), we get a palindrome (5321040401235).
The spelling of 2311020200103 in words is "two trillion, three hundred eleven billion, twenty million, two hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •