Base | Representation |
---|---|
bin | 111111000000010… |
… | …010000000101001 |
3 | 2201200000010001112 |
4 | 333000102000221 |
5 | 4131100212002 |
6 | 252520000105 |
7 | 35123451353 |
oct | 7700220051 |
9 | 2650003045 |
10 | 1057038377 |
11 | 4a274163a |
12 | 256000035 |
13 | 13acbb0c5 |
14 | a05580d3 |
15 | 62beb852 |
hex | 3f012029 |
1057038377 has 2 divisors, whose sum is σ = 1057038378. Its totient is φ = 1057038376.
The previous prime is 1057038361. The next prime is 1057038383. The reversal of 1057038377 is 7738307501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1008443536 + 48594841 = 31756^2 + 6971^2 .
It is an emirp because it is prime and its reverse (7738307501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1057038377 - 24 = 1057038361 is a prime.
It is a super-2 number, since 2×10570383772 = 2234660260901588258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1057038397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528519188 + 528519189.
It is an arithmetic number, because the mean of its divisors is an integer number (528519189).
Almost surely, 21057038377 is an apocalyptic number.
It is an amenable number.
1057038377 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057038377 is an equidigital number, since it uses as much as digits as its factorization.
1057038377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 123480, while the sum is 41.
The square root of 1057038377 is about 32512.1266145418. The cubic root of 1057038377 is about 1018.6623427056.
The spelling of 1057038377 in words is "one billion, fifty-seven million, thirty-eight thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •