Base | Representation |
---|---|
bin | 111111000011111… |
… | …011100011100101 |
3 | 2201201210201021022 |
4 | 333003323203211 |
5 | 4131321314411 |
6 | 252552300525 |
7 | 35134544321 |
oct | 7703734345 |
9 | 2651721238 |
10 | 1057994981 |
11 | 4a323531a |
12 | 2563a1745 |
13 | 13b264644 |
14 | a0726981 |
15 | 62d39edb |
hex | 3f0fb8e5 |
1057994981 has 2 divisors, whose sum is σ = 1057994982. Its totient is φ = 1057994980.
The previous prime is 1057994911. The next prime is 1057994999. The reversal of 1057994981 is 1894997501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 885598081 + 172396900 = 29759^2 + 13130^2 .
It is a cyclic number.
It is not a de Polignac number, because 1057994981 - 210 = 1057993957 is a prime.
It is a super-2 number, since 2×10579949812 = 2238706759642380722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1057994911) 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, 528997490 + 528997491.
It is an arithmetic number, because the mean of its divisors is an integer number (528997491).
Almost surely, 21057994981 is an apocalyptic number.
It is an amenable number.
1057994981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057994981 is an equidigital number, since it uses as much as digits as its factorization.
1057994981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 816480, while the sum is 53.
The square root of 1057994981 is about 32526.8347829911. The cubic root of 1057994981 is about 1018.9695414742.
The spelling of 1057994981 in words is "one billion, fifty-seven million, nine hundred ninety-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •