Base | Representation |
---|---|
bin | 10000110010110… |
… | …01111101010001 |
3 | 100211002022210201 |
4 | 20121121331101 |
5 | 242031041044 |
6 | 21551255201 |
7 | 3330304003 |
oct | 1031317521 |
9 | 324068721 |
10 | 140877649 |
11 | 72581510 |
12 | 3b21a501 |
13 | 23256973 |
14 | 149d2373 |
15 | c57b7d4 |
hex | 8659f51 |
140877649 has 8 divisors (see below), whose sum is σ = 153794592. Its totient is φ = 127979040.
The previous prime is 140877641. The next prime is 140877673. The reversal of 140877649 is 946778041.
140877649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 140877649 - 23 = 140877641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140877599 and 140877608.
It is not an unprimeable number, because it can be changed into a prime (140877641) 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, 15237 + ... + 22669.
It is an arithmetic number, because the mean of its divisors is an integer number (19224324).
Almost surely, 2140877649 is an apocalyptic number.
It is an amenable number.
140877649 is a deficient number, since it is larger than the sum of its proper divisors (12916943).
140877649 is a wasteful number, since it uses less digits than its factorization.
140877649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9167.
The product of its (nonzero) digits is 338688, while the sum is 46.
The square root of 140877649 is about 11869.1890624423. The cubic root of 140877649 is about 520.3321952805.
It can be divided in two parts, 14087 and 7649, that added together give a triangular number (21736 = T208).
The spelling of 140877649 in words is "one hundred forty million, eight hundred seventy-seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •