Base | Representation |
---|---|
bin | 10000101101001… |
… | …11100011110011 |
3 | 100202201012110002 |
4 | 20112213203303 |
5 | 241334200211 |
6 | 21523500215 |
7 | 3321141431 |
oct | 1026474363 |
9 | 322635402 |
10 | 140146931 |
11 | 72122511 |
12 | 3ab2766b |
13 | 2305c1a2 |
14 | 14881d51 |
15 | c48503b |
hex | 85a78f3 |
140146931 has 2 divisors, whose sum is σ = 140146932. Its totient is φ = 140146930.
The previous prime is 140146927. The next prime is 140146943. The reversal of 140146931 is 139641041.
It is a weak prime.
It is an emirp because it is prime and its reverse (139641041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140146931 - 22 = 140146927 is a prime.
It is a super-2 number, since 2×1401469312 = 39282324537437522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140146894 and 140146903.
It is not a weakly prime, because it can be changed into another prime (140146961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70073465 + 70073466.
It is an arithmetic number, because the mean of its divisors is an integer number (70073466).
Almost surely, 2140146931 is an apocalyptic number.
140146931 is a deficient number, since it is larger than the sum of its proper divisors (1).
140146931 is an equidigital number, since it uses as much as digits as its factorization.
140146931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 140146931 is about 11838.3669059546. The cubic root of 140146931 is about 519.4309986621.
Adding to 140146931 its reverse (139641041), we get a palindrome (279787972).
The spelling of 140146931 in words is "one hundred forty million, one hundred forty-six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •