Base | Representation |
---|---|
bin | 10000101110011… |
… | …11100101001001 |
3 | 100210000112022102 |
4 | 20113033211021 |
5 | 241404421412 |
6 | 21531203145 |
7 | 3322423361 |
oct | 1027174511 |
9 | 323015272 |
10 | 140310857 |
11 | 72224695 |
12 | 3aba64b5 |
13 | 230b899b |
14 | 148c59a1 |
15 | c4b88c2 |
hex | 85cf949 |
140310857 has 8 divisors (see below), whose sum is σ = 142035336. Its totient is φ = 138595072.
The previous prime is 140310851. The next prime is 140310869. The reversal of 140310857 is 758013041.
140310857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 219961 + 140090896 = 469^2 + 11836^2 .
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 140310857 - 210 = 140309833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140310851) 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, 33863 + ... + 37779.
It is an arithmetic number, because the mean of its divisors is an integer number (17754417).
Almost surely, 2140310857 is an apocalyptic number.
It is an amenable number.
140310857 is a deficient number, since it is larger than the sum of its proper divisors (1724479).
140310857 is a wasteful number, since it uses less digits than its factorization.
140310857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4347.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 140310857 is about 11845.2883882158. The cubic root of 140310857 is about 519.6334411233.
Adding to 140310857 its reverse (758013041), we get a palindrome (898323898).
The spelling of 140310857 in words is "one hundred forty million, three hundred ten thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •