Base | Representation |
---|---|
bin | 10000110001001… |
… | …10000110011100 |
3 | 100210200112102212 |
4 | 20120212012130 |
5 | 242002241434 |
6 | 21542535552 |
7 | 3325430516 |
oct | 1030460634 |
9 | 323615385 |
10 | 140665244 |
11 | 72446975 |
12 | 3b1375b8 |
13 | 231b1095 |
14 | 14978bb6 |
15 | c5388ce |
hex | 862619c |
140665244 has 6 divisors (see below), whose sum is σ = 246164184. Its totient is φ = 70332620.
The previous prime is 140665241. The next prime is 140665247. The reversal of 140665244 is 442566041.
140665244 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (140665241) and next prime (140665247).
It is a self number, because there is not a number n which added to its sum of digits gives 140665244.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140665241) 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 as a sum of consecutive naturals, namely, 17583152 + ... + 17583159.
It is an arithmetic number, because the mean of its divisors is an integer number (41027364).
Almost surely, 2140665244 is an apocalyptic number.
It is an amenable number.
140665244 is a deficient number, since it is larger than the sum of its proper divisors (105498940).
140665244 is a wasteful number, since it uses less digits than its factorization.
140665244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35166315 (or 35166313 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 32.
The square root of 140665244 is about 11860.2379402776. The cubic root of 140665244 is about 520.0705574869.
The spelling of 140665244 in words is "one hundred forty million, six hundred sixty-five thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •