Search a number
-
+
68956057 is a prime number
BaseRepresentation
bin1000001110000…
…10111110011001
311210202022221001
410013002332121
5120123043212
610501545001
71465055032
oct407027631
9153668831
1068956057
1135a18785
121b115161
1311394601
14922da89
1560c1657
hex41c2f99

68956057 has 2 divisors, whose sum is σ = 68956058. Its totient is φ = 68956056.

The previous prime is 68956037. The next prime is 68956099. The reversal of 68956057 is 75065986.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 58125376 + 10830681 = 7624^2 + 3291^2 .

It is a cyclic number.

It is not a de Polignac number, because 68956057 - 211 = 68954009 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 68955998 and 68956016.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 268956057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 453600, while the sum is 46.

The square root of 68956057 is about 8303.9783838832. The cubic root of 68956057 is about 410.0695043778.

The spelling of 68956057 in words is "sixty-eight million, nine hundred fifty-six thousand, fifty-seven".