Base | Representation |
---|---|
bin | 1001100110001011100101… |
… | …11101010111000011101101 |
3 | 2202201102210112101200010122 |
4 | 10303011302331113003231 |
5 | 10231223123332404401 |
6 | 112514344240014325 |
7 | 4305435364643564 |
oct | 463056275270355 |
9 | 82642715350118 |
10 | 21103103013101 |
11 | 67a685954876a |
12 | 2449b0a6013a5 |
13 | ba1024c00625 |
14 | 52d5778a4bdb |
15 | 268e17e7821b |
hex | 133172f570ed |
21103103013101 has 2 divisors, whose sum is σ = 21103103013102. Its totient is φ = 21103103013100.
The previous prime is 21103103013001. The next prime is 21103103013191. The reversal of 21103103013101 is 10131030130112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20225932155625 + 877170857476 = 4497325^2 + 936574^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21103103013101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21103103013101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21103103013191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10551551506550 + 10551551506551.
It is an arithmetic number, because the mean of its divisors is an integer number (10551551506551).
Almost surely, 221103103013101 is an apocalyptic number.
It is an amenable number.
21103103013101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21103103013101 is an equidigital number, since it uses as much as digits as its factorization.
21103103013101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 21103103013101 its reverse (10131030130112), we get a palindrome (31234133143213).
The spelling of 21103103013101 in words is "twenty-one trillion, one hundred three billion, one hundred three million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •