Base | Representation |
---|---|
bin | 1001100011110001000000… |
… | …11000110110011110000111 |
3 | 2202102111120211200001210211 |
4 | 10301320200120312132013 |
5 | 10223343143003111403 |
6 | 112412301243100251 |
7 | 4266440001205054 |
oct | 461704030663607 |
9 | 82374524601724 |
10 | 21020113332103 |
11 | 6774641a8a046 |
12 | 2435a09511687 |
13 | b9625a588102 |
14 | 529543a4c02b |
15 | 266bac2a306d |
hex | 131e20636787 |
21020113332103 has 8 divisors (see below), whose sum is σ = 22073738512608. Its totient is φ = 19978130419104.
The previous prime is 21020113332089. The next prime is 21020113332109. The reversal of 21020113332103 is 30123331102012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21020113332103 - 221 = 21020111234951 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 (21020113332109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2910563176 + ... + 2910570397.
It is an arithmetic number, because the mean of its divisors is an integer number (2759217314076).
Almost surely, 221020113332103 is an apocalyptic number.
21020113332103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
21020113332103 is a deficient number, since it is larger than the sum of its proper divisors (1053625180505).
21020113332103 is a wasteful number, since it uses less digits than its factorization.
21020113332103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5821133753.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 21020113332103 its reverse (30123331102012), we get a palindrome (51143444434115).
The spelling of 21020113332103 in words is "twenty-one trillion, twenty billion, one hundred thirteen million, three hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •