Base | Representation |
---|---|
bin | 1011010111001011… |
… | …1010010111011001 |
3 | 21212120011012010011 |
4 | 2311302322113121 |
5 | 22221301203421 |
6 | 1222352321521 |
7 | 135403522321 |
oct | 26562722731 |
9 | 7776135104 |
10 | 3050022361 |
11 | 1325726a41 |
12 | 7115432a1 |
13 | 397b79b79 |
14 | 20d108281 |
15 | 12cb754e1 |
hex | b5cba5d9 |
3050022361 has 2 divisors, whose sum is σ = 3050022362. Its totient is φ = 3050022360.
The previous prime is 3050022289. The next prime is 3050022383. The reversal of 3050022361 is 1632200503.
It is an a-pointer prime, because the next prime (3050022383) can be obtained adding 3050022361 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2909955136 + 140067225 = 53944^2 + 11835^2 .
It is a cyclic number.
It is not a de Polignac number, because 3050022361 - 225 = 3016467929 is a prime.
It is not a weakly prime, because it can be changed into another prime (3050022061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1525011180 + 1525011181.
It is an arithmetic number, because the mean of its divisors is an integer number (1525011181).
Almost surely, 23050022361 is an apocalyptic number.
It is an amenable number.
3050022361 is a deficient number, since it is larger than the sum of its proper divisors (1).
3050022361 is an equidigital number, since it uses as much as digits as its factorization.
3050022361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 3050022361 is about 55227.0075325470. The cubic root of 3050022361 is about 1450.2215057562.
Adding to 3050022361 its reverse (1632200503), we get a palindrome (4682222864).
The spelling of 3050022361 in words is "three billion, fifty million, twenty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •