Base | Representation |
---|---|
bin | 1100000000011110… |
… | …0111011110111001 |
3 | 22022122001122122001 |
4 | 3000013213132321 |
5 | 23100121102301 |
6 | 1251500501001 |
7 | 142605636163 |
oct | 30007473671 |
9 | 8278048561 |
10 | 3223222201 |
11 | 1404474601 |
12 | 75b54a761 |
13 | 3c4a0c794 |
14 | 228111933 |
15 | 13ce88c01 |
hex | c01e77b9 |
3223222201 has 2 divisors, whose sum is σ = 3223222202. Its totient is φ = 3223222200.
The previous prime is 3223222183. The next prime is 3223222213. The reversal of 3223222201 is 1022223223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1734805801 + 1488416400 = 41651^2 + 38580^2 .
It is a cyclic number.
It is not a de Polignac number, because 3223222201 - 211 = 3223220153 is a prime.
It is a super-2 number, since 2×32232222012 = 20778322714038568802, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3223222501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611611100 + 1611611101.
It is an arithmetic number, because the mean of its divisors is an integer number (1611611101).
Almost surely, 23223222201 is an apocalyptic number.
It is an amenable number.
3223222201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3223222201 is an equidigital number, since it uses as much as digits as its factorization.
3223222201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 3223222201 is about 56773.4286528478. The cubic root of 3223222201 is about 1477.1686495979.
Adding to 3223222201 its reverse (1022223223), we get a palindrome (4245445424).
The spelling of 3223222201 in words is "three billion, two hundred twenty-three million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •