Base | Representation |
---|---|
bin | 110000010110001001101… |
… | …101100001000010110101 |
3 | 102202121111012110101210012 |
4 | 300112021231201002311 |
5 | 413413102423131404 |
6 | 11022130334310005 |
7 | 462013122105422 |
oct | 60261155410265 |
9 | 12677435411705 |
10 | 3322320130229 |
11 | 1070a961121a1 |
12 | 457a7a358305 |
13 | 1b13a7909059 |
14 | b6b3050cd49 |
15 | 5b64b6b9a6e |
hex | 30589b610b5 |
3322320130229 has 2 divisors, whose sum is σ = 3322320130230. Its totient is φ = 3322320130228.
The previous prime is 3322320130139. The next prime is 3322320130361. The reversal of 3322320130229 is 9220310232233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2021876393329 + 1300443736900 = 1421927^2 + 1140370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3322320130229 is a prime.
It is a super-2 number, since 2×33223201302292 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3322320130195 and 3322320130204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3322320130529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1661160065114 + 1661160065115.
It is an arithmetic number, because the mean of its divisors is an integer number (1661160065115).
Almost surely, 23322320130229 is an apocalyptic number.
It is an amenable number.
3322320130229 is a deficient number, since it is larger than the sum of its proper divisors (1).
3322320130229 is an equidigital number, since it uses as much as digits as its factorization.
3322320130229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 32.
The spelling of 3322320130229 in words is "three trillion, three hundred twenty-two billion, three hundred twenty million, one hundred thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •