Base | Representation |
---|---|
bin | 1001010111110001101… |
… | …00111111001111101101 |
3 | 1010210010212222121111122 |
4 | 10223320310333033231 |
5 | 20233430032020023 |
6 | 403531545030325 |
7 | 32156341465355 |
oct | 4537064771755 |
9 | 1123125877448 |
10 | 322002220013 |
11 | 114618949901 |
12 | 524a5a853a5 |
13 | 2449827a1c6 |
14 | 118292ddb65 |
15 | 85990ca2c8 |
hex | 4af8d3f3ed |
322002220013 has 2 divisors, whose sum is σ = 322002220014. Its totient is φ = 322002220012.
The previous prime is 322002220009. The next prime is 322002220019. The reversal of 322002220013 is 310022200223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 299885473924 + 22116746089 = 547618^2 + 148717^2 .
It is an emirp because it is prime and its reverse (310022200223) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 322002220013 - 22 = 322002220009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 322002219973 and 322002220000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (322002220019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161001110006 + 161001110007.
It is an arithmetic number, because the mean of its divisors is an integer number (161001110007).
Almost surely, 2322002220013 is an apocalyptic number.
It is an amenable number.
322002220013 is a deficient number, since it is larger than the sum of its proper divisors (1).
322002220013 is an equidigital number, since it uses as much as digits as its factorization.
322002220013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 322002220013 its reverse (310022200223), we get a palindrome (632024420236).
The spelling of 322002220013 in words is "three hundred twenty-two billion, two million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •