Base | Representation |
---|---|
bin | 1001001100001110100000… |
… | …00101011001010101011111 |
3 | 2122120011221002122122112110 |
4 | 10212013100011121111133 |
5 | 10122120231410444403 |
6 | 110552540524005103 |
7 | 4154135105064600 |
oct | 446072005312537 |
9 | 78504832578473 |
10 | 20211312203103 |
11 | 649262991591a |
12 | 2325107690793 |
13 | b37bc310b8c8 |
14 | 4dc33887bda7 |
15 | 250b214b9103 |
hex | 1261d015955f |
20211312203103 has 48 divisors (see below), whose sum is σ = 32448949958880. Its totient is φ = 11144253060864.
The previous prime is 20211312203101. The next prime is 20211312203113. The reversal of 20211312203103 is 30130221311202.
It is not a de Polignac number, because 20211312203103 - 21 = 20211312203101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 20211312203103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20211312203101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5530425 + ... + 8426637.
It is an arithmetic number, because the mean of its divisors is an integer number (676019790810).
Almost surely, 220211312203103 is an apocalyptic number.
20211312203103 is a deficient number, since it is larger than the sum of its proper divisors (12237637755777).
20211312203103 is a wasteful number, since it uses less digits than its factorization.
20211312203103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2897896 (or 2897889 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20211312203103 its reverse (30130221311202), we get a palindrome (50341533514305).
The spelling of 20211312203103 in words is "twenty trillion, two hundred eleven billion, three hundred twelve million, two hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •