Base | Representation |
---|---|
bin | 1100000000011110… |
… | …1001011100001101 |
3 | 22022122002001122002 |
4 | 3000013221130031 |
5 | 23100121331341 |
6 | 1251501002045 |
7 | 142606001441 |
oct | 30007513415 |
9 | 8278061562 |
10 | 3223230221 |
11 | 140447a632 |
12 | 75b553325 |
13 | 3c4a13323 |
14 | 228114821 |
15 | 13ce8b29b |
hex | c01e970d |
3223230221 has 2 divisors, whose sum is σ = 3223230222. Its totient is φ = 3223230220.
The previous prime is 3223230187. The next prime is 3223230223. The reversal of 3223230221 is 1220323223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2473072900 + 750157321 = 49730^2 + 27389^2 .
It is a cyclic number.
It is not a de Polignac number, because 3223230221 - 210 = 3223229197 is a prime.
Together with 3223230223, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3223230193 and 3223230202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3223230223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611615110 + 1611615111.
It is an arithmetic number, because the mean of its divisors is an integer number (1611615111).
Almost surely, 23223230221 is an apocalyptic number.
It is an amenable number.
3223230221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3223230221 is an equidigital number, since it uses as much as digits as its factorization.
3223230221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 3223230221 is about 56773.4992844373. The cubic root of 3223230221 is about 1477.1698747572.
Adding to 3223230221 its reverse (1220323223), we get a palindrome (4443553444).
The spelling of 3223230221 in words is "three billion, two hundred twenty-three million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •