Base | Representation |
---|---|
bin | 110000010110000011101… |
… | …111111110000100011101 |
3 | 102202121020020020211222022 |
4 | 300112003233332010131 |
5 | 413412401322010414 |
6 | 11022112402425525 |
7 | 462010466000525 |
oct | 60260357760435 |
9 | 12677206224868 |
10 | 3322220110109 |
11 | 1070a4470763a |
12 | 457a509622a5 |
13 | 1b138cc89354 |
14 | b6b21114685 |
15 | 5b642a0e18e |
hex | 30583bfe11d |
3322220110109 has 2 divisors, whose sum is σ = 3322220110110. Its totient is φ = 3322220110108.
The previous prime is 3322220110091. The next prime is 3322220110123. The reversal of 3322220110109 is 9010110222233.
Together with previous prime (3322220110091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2913432506884 + 408787603225 = 1706878^2 + 639365^2 .
It is a cyclic number.
It is not a de Polignac number, because 3322220110109 - 212 = 3322220106013 is a prime.
It is a super-2 number, since 2×33222201101092 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3322220110199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1661110055054 + 1661110055055.
It is an arithmetic number, because the mean of its divisors is an integer number (1661110055055).
Almost surely, 23322220110109 is an apocalyptic number.
It is an amenable number.
3322220110109 is a deficient number, since it is larger than the sum of its proper divisors (1).
3322220110109 is an equidigital number, since it uses as much as digits as its factorization.
3322220110109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 3322220110109 in words is "three trillion, three hundred twenty-two billion, two hundred twenty million, one hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •