Base | Representation |
---|---|
bin | 10000110001010… |
… | …10101010010111 |
3 | 100210201111001211 |
4 | 20120222222113 |
5 | 242003341202 |
6 | 21543202251 |
7 | 3325536136 |
oct | 1030525227 |
9 | 323644054 |
10 | 140683927 |
11 | 72459a0a |
12 | 3b146387 |
13 | 231b9737 |
14 | 1498191d |
15 | c53e1d7 |
hex | 862aa97 |
140683927 has 2 divisors, whose sum is σ = 140683928. Its totient is φ = 140683926.
The previous prime is 140683919. The next prime is 140683967. The reversal of 140683927 is 729386041.
It is an a-pointer prime, because the next prime (140683967) can be obtained adding 140683927 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 140683927 - 23 = 140683919 is a prime.
It is a super-2 number, since 2×1406839272 = 39583934632282658, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140683927.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140683967) 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, 70341963 + 70341964.
It is an arithmetic number, because the mean of its divisors is an integer number (70341964).
Almost surely, 2140683927 is an apocalyptic number.
140683927 is a deficient number, since it is larger than the sum of its proper divisors (1).
140683927 is an equidigital number, since it uses as much as digits as its factorization.
140683927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 40.
The square root of 140683927 is about 11861.0255458792. The cubic root of 140683927 is about 520.0935815304.
The spelling of 140683927 in words is "one hundred forty million, six hundred eighty-three thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •