Base | Representation |
---|---|
bin | 10000101110100… |
… | …00011100111101 |
3 | 100210000201012201 |
4 | 20113100130331 |
5 | 241410030204 |
6 | 21531231501 |
7 | 3322436653 |
oct | 1027203475 |
9 | 323021181 |
10 | 140314429 |
11 | 72227342 |
12 | 3aba8591 |
13 | 230ba4b8 |
14 | 148c6dd3 |
15 | c4b99a4 |
hex | 85d073d |
140314429 has 2 divisors, whose sum is σ = 140314430. Its totient is φ = 140314428.
The previous prime is 140314409. The next prime is 140314451. The reversal of 140314429 is 924413041.
140314429 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140304025 + 10404 = 11845^2 + 102^2 .
It is an emirp because it is prime and its reverse (924413041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140314429 - 213 = 140306237 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 140314397 and 140314406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140314409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70157214 + 70157215.
It is an arithmetic number, because the mean of its divisors is an integer number (70157215).
Almost surely, 2140314429 is an apocalyptic number.
It is an amenable number.
140314429 is a deficient number, since it is larger than the sum of its proper divisors (1).
140314429 is an equidigital number, since it uses as much as digits as its factorization.
140314429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 140314429 is about 11845.4391645055. The cubic root of 140314429 is about 519.6378506535.
The spelling of 140314429 in words is "one hundred forty million, three hundred fourteen thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •