Base | Representation |
---|---|
bin | 101110110110111110001… |
… | …111011011011100011001 |
3 | 102101211200212001122221112 |
4 | 232312332033123130121 |
5 | 410224302242022223 |
6 | 10503145334350105 |
7 | 451434426154325 |
oct | 56667617333431 |
9 | 12354625048845 |
10 | 3220122220313 |
11 | 1031712054919 |
12 | 4400b84bb335 |
13 | 1a486b94a3cb |
14 | b1bd75d6985 |
15 | 58b69527778 |
hex | 2edbe3db719 |
3220122220313 has 2 divisors, whose sum is σ = 3220122220314. Its totient is φ = 3220122220312.
The previous prime is 3220122220307. The next prime is 3220122220339. The reversal of 3220122220313 is 3130222210223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2206389393664 + 1013732826649 = 1485392^2 + 1006843^2 .
It is a cyclic number.
It is not a de Polignac number, because 3220122220313 - 210 = 3220122219289 is a prime.
It is a super-2 number, since 2×32201222203132 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (3220122220373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610061110156 + 1610061110157.
It is an arithmetic number, because the mean of its divisors is an integer number (1610061110157).
Almost surely, 23220122220313 is an apocalyptic number.
It is an amenable number.
3220122220313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220122220313 is an equidigital number, since it uses as much as digits as its factorization.
3220122220313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 3220122220313 its reverse (3130222210223), we get a palindrome (6350344430536).
The spelling of 3220122220313 in words is "three trillion, two hundred twenty billion, one hundred twenty-two million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •