Base | Representation |
---|---|
bin | 1011010101110000… |
… | …0001011111001101 |
3 | 21212010212100110202 |
4 | 2311130001133031 |
5 | 22213232202341 |
6 | 1222015543245 |
7 | 135301522232 |
oct | 26534013715 |
9 | 7763770422 |
10 | 3044022221 |
11 | 13222a8a49 |
12 | 70b52ab25 |
13 | 396858aa6 |
14 | 20c3c5789 |
15 | 12c38c79b |
hex | b57017cd |
3044022221 has 2 divisors, whose sum is σ = 3044022222. Its totient is φ = 3044022220.
The previous prime is 3044022217. The next prime is 3044022251. The reversal of 3044022221 is 1222204403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2715868996 + 328153225 = 52114^2 + 18115^2 .
It is a cyclic number.
It is not a de Polignac number, because 3044022221 - 22 = 3044022217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3044022193 and 3044022202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3044022211) 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, 1522011110 + 1522011111.
It is an arithmetic number, because the mean of its divisors is an integer number (1522011111).
Almost surely, 23044022221 is an apocalyptic number.
It is an amenable number.
3044022221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3044022221 is an equidigital number, since it uses as much as digits as its factorization.
3044022221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 3044022221 is about 55172.6582738226. The cubic root of 3044022221 is about 1449.2699013313.
Adding to 3044022221 its reverse (1222204403), we get a palindrome (4266226624).
The spelling of 3044022221 in words is "three billion, forty-four million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •