Base | Representation |
---|---|
bin | 1001000110000110110011… |
… | …10000100010100000011111 |
3 | 2121211002010112212021122212 |
4 | 10203003121300202200133 |
5 | 10110144042401012203 |
6 | 110312201532031035 |
7 | 4133011643224562 |
oct | 443033160424037 |
9 | 77732115767585 |
10 | 20001021110303 |
11 | 6411426a9a352 |
12 | 22b03b960247b |
13 | b2111ba0280c |
14 | 4d20a9b024d9 |
15 | 24a4148371d8 |
hex | 1230d9c2281f |
20001021110303 has 4 divisors (see below), whose sum is σ = 20466161136168. Its totient is φ = 19535881084440.
The previous prime is 20001021110263. The next prime is 20001021110383. The reversal of 20001021110303 is 30301112010002.
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 20001021110303 - 212 = 20001021106207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001021110383) 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, 232570012868 + ... + 232570012953.
It is an arithmetic number, because the mean of its divisors is an integer number (5116540284042).
Almost surely, 220001021110303 is an apocalyptic number.
20001021110303 is a deficient number, since it is larger than the sum of its proper divisors (465140025865).
20001021110303 is an equidigital number, since it uses as much as digits as its factorization.
20001021110303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465140025864.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 20001021110303 its reverse (30301112010002), we get a palindrome (50302133120305).
The spelling of 20001021110303 in words is "twenty trillion, one billion, twenty-one million, one hundred ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •