Search a number
-
+
68911051 = 117385817
BaseRepresentation
bin1000001101101…
…11111111001011
311210200001012011
410012313333023
5120120123201
610501000351
71464506566
oct406677713
9153601164
1068911051
1135997990
121b0b30b7
1311379c91
14921b4dd
1560b3151
hex41b7fcb

68911051 has 8 divisors (see below), whose sum is σ = 76206384. Its totient is φ = 61787520.

The previous prime is 68911039. The next prime is 68911061. The reversal of 68911051 is 15011986.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 68911051 - 223 = 60522443 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (68911001) 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 in 7 ways as a sum of consecutive naturals, for example, 42106 + ... + 43711.

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

Almost surely, 268911051 is an apocalyptic number.

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

68911051 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 85901.

The product of its (nonzero) digits is 2160, while the sum is 31.

The square root of 68911051 is about 8301.2680356678. The cubic root of 68911051 is about 409.9802707143.

It can be divided in two parts, 68 and 911051, that added together give a palindrome (911119).

The spelling of 68911051 in words is "sixty-eight million, nine hundred eleven thousand, fifty-one".

Divisors: 1 11 73 803 85817 943987 6264641 68911051