Base | Representation |
---|---|
bin | 1000001010110011110… |
… | …0010000100111011111 |
3 | 111102020120021120201212 |
4 | 2002230330100213133 |
5 | 4244404122300302 |
6 | 144245502255035 |
7 | 13065523661315 |
oct | 2025474204737 |
9 | 442216246655 |
10 | 140340431327 |
11 | 54577573248 |
12 | 2324788747b |
13 | 10307277a55 |
14 | 6b149280b5 |
15 | 39b5a6a052 |
hex | 20acf109df |
140340431327 has 2 divisors, whose sum is σ = 140340431328. Its totient is φ = 140340431326.
The previous prime is 140340431249. The next prime is 140340431353. The reversal of 140340431327 is 723134043041.
It is a happy number.
140340431327 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140340431327 - 214 = 140340414943 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140340431293 and 140340431302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140340431027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70170215663 + 70170215664.
It is an arithmetic number, because the mean of its divisors is an integer number (70170215664).
Almost surely, 2140340431327 is an apocalyptic number.
140340431327 is a deficient number, since it is larger than the sum of its proper divisors (1).
140340431327 is an equidigital number, since it uses as much as digits as its factorization.
140340431327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 32.
Adding to 140340431327 its reverse (723134043041), we get a palindrome (863474474368).
The spelling of 140340431327 in words is "one hundred forty billion, three hundred forty million, four hundred thirty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •