Search a number
-
+
1057156481 is a prime number
BaseRepresentation
bin111111000000101…
…110110110000001
32201200020010001202
4333000232312001
54131113001411
6252522310545
735124452603
oct7700566601
92650203052
101057156481
114a2812347
12256058455
1313b02caa4
14a0589173
1562c2183b
hex3f02ed81

1057156481 has 2 divisors, whose sum is σ = 1057156482. Its totient is φ = 1057156480.

The previous prime is 1057156427. The next prime is 1057156483. The reversal of 1057156481 is 1846517501.

1057156481 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., 840478081 + 216678400 = 28991^2 + 14720^2 .

It is a cyclic number.

It is not a de Polignac number, because 1057156481 - 210 = 1057155457 is a prime.

It is a super-2 number, since 2×10571564812 = 2235159650640606722, which contains 22 as substring.

Together with 1057156483, it forms a pair of twin primes.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (1057156483) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528578240 + 528578241.

It is an arithmetic number, because the mean of its divisors is an integer number (528578241).

Almost surely, 21057156481 is an apocalyptic number.

It is an amenable number.

1057156481 is a deficient number, since it is larger than the sum of its proper divisors (1).

1057156481 is an equidigital number, since it uses as much as digits as its factorization.

1057156481 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 33600, while the sum is 38.

The square root of 1057156481 is about 32513.9428707132. The cubic root of 1057156481 is about 1018.7002800280.

The spelling of 1057156481 in words is "one billion, fifty-seven million, one hundred fifty-six thousand, four hundred eighty-one".