Base | Representation |
---|---|
bin | 1001001011111111000011… |
… | …11001110011110011101111 |
3 | 2122112101112021201010101001 |
4 | 10211333201321303303233 |
5 | 10122001241413033403 |
6 | 110545050111301131 |
7 | 4153422461644450 |
oct | 445774171636357 |
9 | 78471467633331 |
10 | 20203021221103 |
11 | 648a064873386 |
12 | 2323592b1a7a7 |
13 | b371a15075b6 |
14 | 4dbb8d6ab127 |
15 | 2507d8691c1d |
hex | 125fe1e73cef |
20203021221103 has 8 divisors (see below), whose sum is σ = 23089265004672. Its totient is φ = 17316801911256.
The previous prime is 20203021221077. The next prime is 20203021221143. The reversal of 20203021221103 is 30112212030202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20203021221103 - 225 = 20202987666671 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 (20203021221143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4314025 + ... + 7682242.
It is an arithmetic number, because the mean of its divisors is an integer number (2886158125584).
Almost surely, 220203021221103 is an apocalyptic number.
20203021221103 is a deficient number, since it is larger than the sum of its proper divisors (2886243783569).
20203021221103 is a wasteful number, since it uses less digits than its factorization.
20203021221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12236861.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20203021221103 its reverse (30112212030202), we get a palindrome (50315233251305).
The spelling of 20203021221103 in words is "twenty trillion, two hundred three billion, twenty-one million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •