Search a number
-
+
689154051 = 3792907823
BaseRepresentation
bin101001000100111…
…010100000000011
31210000202122122010
4221010322200003
52402410412201
6152214544003
723035466325
oct5104724003
91700678563
10689154051
11324011703
12172968003
13aca12781
1467753615
154077dbd6
hex2913a803

689154051 has 8 divisors (see below), whose sum is σ = 930503680. Its totient is φ = 453620232.

The previous prime is 689154031. The next prime is 689154097. The reversal of 689154051 is 150451986.

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

It is not a de Polignac number, because 689154051 - 27 = 689153923 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2689154051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2907905.

The product of its (nonzero) digits is 43200, while the sum is 39.

The square root of 689154051 is about 26251.7437706526. The cubic root of 689154051 is about 883.2943201313.

The spelling of 689154051 in words is "six hundred eighty-nine million, one hundred fifty-four thousand, fifty-one".

Divisors: 1 3 79 237 2907823 8723469 229718017 689154051