Base | Representation |
---|---|
bin | 10000101101001… |
… | …00101110011001 |
3 | 100202200121112002 |
4 | 20112210232121 |
5 | 241333312241 |
6 | 21523330345 |
7 | 3321062534 |
oct | 1026445631 |
9 | 322617462 |
10 | 140135321 |
11 | 72114817 |
12 | 3ab209b5 |
13 | 23056b11 |
14 | 1487ba1b |
15 | c48189b |
hex | 85a4b99 |
140135321 has 2 divisors, whose sum is σ = 140135322. Its totient is φ = 140135320.
The previous prime is 140135293. The next prime is 140135351. The reversal of 140135321 is 123531041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113209600 + 26925721 = 10640^2 + 5189^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140135321 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 140135293 and 140135302.
It is not a weakly prime, because it can be changed into another prime (140135351) 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, 70067660 + 70067661.
It is an arithmetic number, because the mean of its divisors is an integer number (70067661).
Almost surely, 2140135321 is an apocalyptic number.
It is an amenable number.
140135321 is a deficient number, since it is larger than the sum of its proper divisors (1).
140135321 is an equidigital number, since it uses as much as digits as its factorization.
140135321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 140135321 is about 11837.8765410018. The cubic root of 140135321 is about 519.4166547627.
Adding to 140135321 its reverse (123531041), we get a palindrome (263666362).
The spelling of 140135321 in words is "one hundred forty million, one hundred thirty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •