Base | Representation |
---|---|
bin | 10000101110100… |
… | …11100000011011 |
3 | 100210001100101001 |
4 | 20113103200123 |
5 | 241410430224 |
6 | 21531405431 |
7 | 3322521304 |
oct | 1027234033 |
9 | 323040331 |
10 | 140326939 |
11 | 72235785 |
12 | 3abb3877 |
13 | 230c30bc |
14 | 148cb7ab |
15 | c4bd544 |
hex | 85d381b |
140326939 has 2 divisors, whose sum is σ = 140326940. Its totient is φ = 140326938.
The previous prime is 140326909. The next prime is 140326943. The reversal of 140326939 is 939623041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140326939 - 27 = 140326811 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 140326898 and 140326907.
It is not a weakly prime, because it can be changed into another prime (140326909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70163469 + 70163470.
It is an arithmetic number, because the mean of its divisors is an integer number (70163470).
Almost surely, 2140326939 is an apocalyptic number.
140326939 is a deficient number, since it is larger than the sum of its proper divisors (1).
140326939 is an equidigital number, since it uses as much as digits as its factorization.
140326939 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 37.
The square root of 140326939 is about 11845.9672040741. The cubic root of 140326939 is about 519.6532932952.
The spelling of 140326939 in words is "one hundred forty million, three hundred twenty-six thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •