Base | Representation |
---|---|
bin | 1011010111001100… |
… | …0010011011010001 |
3 | 21212120012212101222 |
4 | 2311303002123101 |
5 | 22221303233002 |
6 | 1222353134425 |
7 | 135404020505 |
oct | 26563023321 |
9 | 7776185358 |
10 | 3050055377 |
11 | 1325749826 |
12 | 71155a415 |
13 | 397b8bbc5 |
14 | 20d116305 |
15 | 12cb801a2 |
hex | b5cc26d1 |
3050055377 has 2 divisors, whose sum is σ = 3050055378. Its totient is φ = 3050055376.
The previous prime is 3050055347. The next prime is 3050055383. The reversal of 3050055377 is 7735500503.
3050055377 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2856261136 + 193794241 = 53444^2 + 13921^2 .
It is an emirp because it is prime and its reverse (7735500503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3050055377 - 216 = 3049989841 is a prime.
It is a super-2 number, since 2×30500553772 = 18605675605533224258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3050055347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1525027688 + 1525027689.
It is an arithmetic number, because the mean of its divisors is an integer number (1525027689).
Almost surely, 23050055377 is an apocalyptic number.
It is an amenable number.
3050055377 is a deficient number, since it is larger than the sum of its proper divisors (1).
3050055377 is an equidigital number, since it uses as much as digits as its factorization.
3050055377 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55125, while the sum is 35.
The square root of 3050055377 is about 55227.3064434615. The cubic root of 3050055377 is about 1450.2267385419.
The spelling of 3050055377 in words is "three billion, fifty million, fifty-five thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •