Base | Representation |
---|---|
bin | 1011100111111010… |
… | …1100100010100001 |
3 | 22001110020121121121 |
4 | 2321332230202201 |
5 | 22342234022241 |
6 | 1233341052241 |
7 | 140215302151 |
oct | 27176544241 |
9 | 8043217547 |
10 | 3120220321 |
11 | 1361312789 |
12 | 730b57081 |
13 | 3a958781a |
14 | 21857c761 |
15 | 133ddead1 |
hex | b9fac8a1 |
3120220321 has 2 divisors, whose sum is σ = 3120220322. Its totient is φ = 3120220320.
The previous prime is 3120220291. The next prime is 3120220331. The reversal of 3120220321 is 1230220213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3093584400 + 26635921 = 55620^2 + 5161^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120220321 - 25 = 3120220289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3120220295 and 3120220304.
It is not a weakly prime, because it can be changed into another prime (3120220331) 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, 1560110160 + 1560110161.
It is an arithmetic number, because the mean of its divisors is an integer number (1560110161).
Almost surely, 23120220321 is an apocalyptic number.
It is an amenable number.
3120220321 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120220321 is an equidigital number, since it uses as much as digits as its factorization.
3120220321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 3120220321 is about 55858.9323295746. The cubic root of 3120220321 is about 1461.2631092350.
Adding to 3120220321 its reverse (1230220213), we get a palindrome (4350440534).
The spelling of 3120220321 in words is "three billion, one hundred twenty million, two hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •