Base | Representation |
---|---|
bin | 1001100110001011100110… |
… | …11101011001000110110111 |
3 | 2202201102211010012021122201 |
4 | 10303011303131121012313 |
5 | 10231223133010110403 |
6 | 112514345140005331 |
7 | 4305435526215622 |
oct | 463056335310667 |
9 | 82642733167581 |
10 | 21103111410103 |
11 | 67a6863263538 |
12 | 2449b11390847 |
13 | ba1026880678 |
14 | 52d578a4cdb9 |
15 | 268e18a8621d |
hex | 1331737591b7 |
21103111410103 has 4 divisors (see below), whose sum is σ = 21112298661600. Its totient is φ = 21093924158608.
The previous prime is 21103111410083. The next prime is 21103111410197. The reversal of 21103111410103 is 30101411130112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21103111410103 is a prime.
It is a super-2 number, since 2×211031114101032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21103117410103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4593622303 + ... + 4593626896.
It is an arithmetic number, because the mean of its divisors is an integer number (5278074665400).
Almost surely, 221103111410103 is an apocalyptic number.
21103111410103 is a deficient number, since it is larger than the sum of its proper divisors (9187251497).
21103111410103 is an equidigital number, since it uses as much as digits as its factorization.
21103111410103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9187251496.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 21103111410103 its reverse (30101411130112), we get a palindrome (51204522540215).
The spelling of 21103111410103 in words is "twenty-one trillion, one hundred three billion, one hundred eleven million, four hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •