Base | Representation |
---|---|
bin | 1001001111001100010011… |
… | …01011011100100000100101 |
3 | 2122220220221112201202020112 |
4 | 10213212021223130200211 |
5 | 10130302423303212331 |
6 | 111111432051542405 |
7 | 4164403166623106 |
oct | 447461153344045 |
9 | 78826845652215 |
10 | 20313210210341 |
11 | 6521869665944 |
12 | 2340a04bbaa05 |
13 | b446b1c04b49 |
14 | 503243a083ad |
15 | 2535d716b32b |
hex | 127989adc825 |
20313210210341 has 2 divisors, whose sum is σ = 20313210210342. Its totient is φ = 20313210210340.
The previous prime is 20313210210323. The next prime is 20313210210343. The reversal of 20313210210341 is 14301201231302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17985614493025 + 2327595717316 = 4240945^2 + 1525646^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20313210210341 is a prime.
Together with 20313210210343, 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 (20313210210343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10156605105170 + 10156605105171.
It is an arithmetic number, because the mean of its divisors is an integer number (10156605105171).
Almost surely, 220313210210341 is an apocalyptic number.
It is an amenable number.
20313210210341 is a deficient number, since it is larger than the sum of its proper divisors (1).
20313210210341 is an equidigital number, since it uses as much as digits as its factorization.
20313210210341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20313210210341 its reverse (14301201231302), we get a palindrome (34614411441643).
The spelling of 20313210210341 in words is "twenty trillion, three hundred thirteen billion, two hundred ten million, two hundred ten thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •