Base | Representation |
---|---|
bin | 10000101101000… |
… | …11101000011111 |
3 | 100202200101101101 |
4 | 20112203220133 |
5 | 241333141342 |
6 | 21523253531 |
7 | 3321043513 |
oct | 1026435037 |
9 | 322611341 |
10 | 140130847 |
11 | 7211141a |
12 | 3ab1a2a7 |
13 | 23054a7c |
14 | 1487a143 |
15 | c4803b7 |
hex | 85a3a1f |
140130847 has 8 divisors (see below), whose sum is σ = 150807312. Its totient is φ = 129724800.
The previous prime is 140130839. The next prime is 140130853. The reversal of 140130847 is 748031041.
140130847 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 140130847 - 23 = 140130839 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140130817) 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, 66529 + ... + 68602.
It is an arithmetic number, because the mean of its divisors is an integer number (18850914).
Almost surely, 2140130847 is an apocalyptic number.
140130847 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
140130847 is a deficient number, since it is larger than the sum of its proper divisors (10676465).
140130847 is a wasteful number, since it uses less digits than its factorization.
140130847 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135209.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 140130847 is about 11837.6875697917. The cubic root of 140130847 is about 519.4111270227.
Adding to 140130847 its reverse (748031041), we get a palindrome (888161888).
The spelling of 140130847 in words is "one hundred forty million, one hundred thirty thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •