Search a number
-
+
140006951 = 7171176529
BaseRepresentation
bin10000101100001…
…01011000100111
3100202110002102122
420112011120213
5241320210301
621520500155
73320016350
oct1026053047
9322402378
10140006951
1172037327
123aa7a65b
1323010566
1414846d27
15c45881b
hex8585627

140006951 has 8 divisors (see below), whose sum is σ = 169420320. Its totient is φ = 112946688.

The previous prime is 140006947. The next prime is 140006969. The reversal of 140006951 is 159600041.

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 140006951 - 22 = 140006947 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 140006951.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 588146 + ... + 588383.

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

Almost surely, 2140006951 is an apocalyptic number.

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

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

140006951 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1176553.

The product of its (nonzero) digits is 1080, while the sum is 26.

The square root of 140006951 is about 11832.4532959146. The cubic root of 140006951 is about 519.2580036206.

Adding to 140006951 its reverse (159600041), we get a palindrome (299606992).

The spelling of 140006951 in words is "one hundred forty million, six thousand, nine hundred fifty-one".

Divisors: 1 7 17 119 1176529 8235703 20000993 140006951