Base | Representation |
---|---|
bin | 1001001110111000000001… |
… | …01000110011000110111101 |
3 | 2122212212211122221210112111 |
4 | 10213130000220303012331 |
5 | 10130113123200301133 |
6 | 111102431344334021 |
7 | 4163536305011245 |
oct | 447340050630675 |
9 | 78785748853474 |
10 | 20302321103293 |
11 | 6518190a89619 |
12 | 233a886314311 |
13 | b43667c66138 |
14 | 5028cd762b25 |
15 | 25319b1d41cd |
hex | 127700a331bd |
20302321103293 has 2 divisors, whose sum is σ = 20302321103294. Its totient is φ = 20302321103292.
The previous prime is 20302321103291. The next prime is 20302321103357. The reversal of 20302321103293 is 39230112320302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15195362923129 + 5106958180164 = 3898123^2 + 2259858^2 .
It is a cyclic number.
It is not a de Polignac number, because 20302321103293 - 21 = 20302321103291 is a prime.
Together with 20302321103291, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20302321103291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10151160551646 + 10151160551647.
It is an arithmetic number, because the mean of its divisors is an integer number (10151160551647).
Almost surely, 220302321103293 is an apocalyptic number.
It is an amenable number.
20302321103293 is a deficient number, since it is larger than the sum of its proper divisors (1).
20302321103293 is an equidigital number, since it uses as much as digits as its factorization.
20302321103293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
Adding to 20302321103293 its reverse (39230112320302), we get a palindrome (59532433423595).
The spelling of 20302321103293 in words is "twenty trillion, three hundred two billion, three hundred twenty-one million, one hundred three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •