Search a number
-
+
103256057 is a prime number
BaseRepresentation
bin1100010011110…
…00111111111001
321012021221200102
412021320333321
5202413143212
614125045145
72362443032
oct611707771
9235257612
10103256057
1153315893
122a6b67b5
1318513878
14d9dba89
1590e95c2
hex6278ff9

103256057 has 2 divisors, whose sum is σ = 103256058. Its totient is φ = 103256056.

The previous prime is 103256053. The next prime is 103256063. The reversal of 103256057 is 750652301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 66520336 + 36735721 = 8156^2 + 6061^2 .

It is a cyclic number.

It is not a de Polignac number, because 103256057 - 22 = 103256053 is a prime.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (103256053) 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, 51628028 + 51628029.

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

Almost surely, 2103256057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6300, while the sum is 29.

The square root of 103256057 is about 10161.4987575652. The cubic root of 103256057 is about 469.1429332960.

The spelling of 103256057 in words is "one hundred three million, two hundred fifty-six thousand, fifty-seven".