Search a number
-
+
140629951 = 7211223719
BaseRepresentation
bin10000110000111…
…01011110111111
3100210121202000201
420120131132333
5242000124301
621542104331
73325222600
oct1030353677
9323552021
10140629951
1172422400
123b11b0a7
132319acb7
1414969da7
15c52d201
hex861d7bf

140629951 has 18 divisors (see below), whose sum is σ = 179821320. Its totient is φ = 109577160.

The previous prime is 140629939. The next prime is 140629987. The reversal of 140629951 is 159926041.

It is not a de Polignac number, because 140629951 - 219 = 140105663 is a prime.

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

It is a congruent number.

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

Almost surely, 2140629951 is an apocalyptic number.

140629951 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 23755 (or 23737 counting only the distinct ones).

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

The square root of 140629951 is about 11858.7499762833. The cubic root of 140629951 is about 520.0270585032.

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

Divisors: 1 7 11 49 77 121 539 847 5929 23719 166033 260909 1162231 1826363 2869999 12784541 20089993 140629951