Base | Representation |
---|---|
bin | 1001001111101111101011… |
… | …00100111100000010110101 |
3 | 2122222201221222221220210112 |
4 | 10213313311210330002311 |
5 | 10131110321240004023 |
6 | 111124252303432405 |
7 | 4165644610054661 |
oct | 447676544740265 |
9 | 78881858856715 |
10 | 20332200313013 |
11 | 6529924021076 |
12 | 23446248b5705 |
13 | b4641a2b86a4 |
14 | 504125b278a1 |
15 | 253d493ed478 |
hex | 127df593c0b5 |
20332200313013 has 2 divisors, whose sum is σ = 20332200313014. Its totient is φ = 20332200313012.
The previous prime is 20332200312967. The next prime is 20332200313021. The reversal of 20332200313013 is 31031300223302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14104215891364 + 6227984421649 = 3755558^2 + 2495593^2 .
It is a cyclic number.
It is not a de Polignac number, because 20332200313013 - 228 = 20331931877557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20332200313013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20332200313093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10166100156506 + 10166100156507.
It is an arithmetic number, because the mean of its divisors is an integer number (10166100156507).
Almost surely, 220332200313013 is an apocalyptic number.
It is an amenable number.
20332200313013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20332200313013 is an equidigital number, since it uses as much as digits as its factorization.
20332200313013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 20332200313013 its reverse (31031300223302), we get a palindrome (51363500536315).
The spelling of 20332200313013 in words is "twenty trillion, three hundred thirty-two billion, two hundred million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •