Base | Representation |
---|---|
bin | 1011010111010100… |
… | …1000101010011101 |
3 | 21212121020210122021 |
4 | 2311311020222131 |
5 | 22221423331323 |
6 | 1222413020141 |
7 | 135411500515 |
oct | 26565105235 |
9 | 7777223567 |
10 | 3050605213 |
11 | 1325a94937 |
12 | 711784651 |
13 | 398022256 |
14 | 20d21a845 |
15 | 12cc3d05d |
hex | b5d48a9d |
3050605213 has 2 divisors, whose sum is σ = 3050605214. Its totient is φ = 3050605212.
The previous prime is 3050605183. The next prime is 3050605219. The reversal of 3050605213 is 3125060503.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2939049369 + 111555844 = 54213^2 + 10562^2 .
It is a cyclic number.
It is not a de Polignac number, because 3050605213 - 213 = 3050597021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3050605219) 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, 1525302606 + 1525302607.
It is an arithmetic number, because the mean of its divisors is an integer number (1525302607).
Almost surely, 23050605213 is an apocalyptic number.
It is an amenable number.
3050605213 is a deficient number, since it is larger than the sum of its proper divisors (1).
3050605213 is an equidigital number, since it uses as much as digits as its factorization.
3050605213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 3050605213 is about 55232.2841551931. The cubic root of 3050605213 is about 1450.3138778296.
Adding to 3050605213 its reverse (3125060503), we get a palindrome (6175665716).
The spelling of 3050605213 in words is "three billion, fifty million, six hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •