Base | Representation |
---|---|
bin | 1001010111101000101110… |
… | …11000010110111001000101 |
3 | 2200221122211220122111121212 |
4 | 10223310113120112321011 |
5 | 10200031130144130401 |
6 | 111453014250421205 |
7 | 4224354141441626 |
oct | 453642730267105 |
9 | 80848756574555 |
10 | 20603350380101 |
11 | 6623917185805 |
12 | 2389098431805 |
13 | b65b700b2978 |
14 | 5132c9473a4d |
15 | 25ae18e08dbb |
hex | 12bd17616e45 |
20603350380101 has 2 divisors, whose sum is σ = 20603350380102. Its totient is φ = 20603350380100.
The previous prime is 20603350380097. The next prime is 20603350380103. The reversal of 20603350380101 is 10108305330602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13847255016100 + 6756095364001 = 3721190^2 + 2599249^2 .
It is a cyclic number.
It is not a de Polignac number, because 20603350380101 - 22 = 20603350380097 is a prime.
Together with 20603350380103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20603350380103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10301675190050 + 10301675190051.
It is an arithmetic number, because the mean of its divisors is an integer number (10301675190051).
Almost surely, 220603350380101 is an apocalyptic number.
It is an amenable number.
20603350380101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20603350380101 is an equidigital number, since it uses as much as digits as its factorization.
20603350380101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 20603350380101 in words is "twenty trillion, six hundred three billion, three hundred fifty million, three hundred eighty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •