Base | Representation |
---|---|
bin | 10000110001010… |
… | …10000110000111 |
3 | 100210201100212220 |
4 | 20120222012013 |
5 | 242003302412 |
6 | 21543143423 |
7 | 3325526313 |
oct | 1030520607 |
9 | 323640786 |
10 | 140681607 |
11 | 724581a0 |
12 | 3b144b73 |
13 | 231b8671 |
14 | 14980b43 |
15 | c53d68c |
hex | 862a187 |
140681607 has 8 divisors (see below), whose sum is σ = 204627840. Its totient is φ = 85261560.
The previous prime is 140681603. The next prime is 140681609. The reversal of 140681607 is 706186041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140681607 - 22 = 140681603 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 4263079 = 140681607 / (1 + 4 + 0 + 6 + 8 + 1 + 6 + 0 + 7).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140681603) 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, 2131507 + ... + 2131572.
It is an arithmetic number, because the mean of its divisors is an integer number (25578480).
Almost surely, 2140681607 is an apocalyptic number.
140681607 is a deficient number, since it is larger than the sum of its proper divisors (63946233).
140681607 is a wasteful number, since it uses less digits than its factorization.
140681607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4263093.
The product of its (nonzero) digits is 8064, while the sum is 33.
The square root of 140681607 is about 11860.9277461757. The cubic root of 140681607 is about 520.0907225833.
The spelling of 140681607 in words is "one hundred forty million, six hundred eighty-one thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •