Search a number
-
+
68911507 = 79844501
BaseRepresentation
bin1000001101110…
…00000110010011
311210200001211001
410012320012103
5120120132012
610501002431
71464511120
oct406700623
9153601731
1068911507
1135998265
121b0b3417
131137a252
14921b747
1560b3357
hex41b8193

68911507 has 4 divisors (see below), whose sum is σ = 78756016. Its totient is φ = 59067000.

The previous prime is 68911471. The next prime is 68911547. The reversal of 68911507 is 70511986.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 68911507 - 27 = 68911379 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (68911547) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4922244 + ... + 4922257.

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

Almost surely, 268911507 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9844508.

The product of its (nonzero) digits is 15120, while the sum is 37.

The square root of 68911507 is about 8301.2955013058. The cubic root of 68911507 is about 409.9811750230.

The spelling of 68911507 in words is "sixty-eight million, nine hundred eleven thousand, five hundred seven".

Divisors: 1 7 9844501 68911507