Base | Representation |
---|---|
bin | 10000110010011… |
… | …01110000100001 |
3 | 100210222210021001 |
4 | 20121031300201 |
5 | 242022441211 |
6 | 21550232001 |
7 | 3330005221 |
oct | 1031156041 |
9 | 323883231 |
10 | 140827681 |
11 | 72547a15 |
12 | 3b1b5601 |
13 | 23239cb7 |
14 | 149bc081 |
15 | c56bac1 |
hex | 864dc21 |
140827681 has 2 divisors, whose sum is σ = 140827682. Its totient is φ = 140827680.
The previous prime is 140827679. The next prime is 140827697. The reversal of 140827681 is 186728041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 135024400 + 5803281 = 11620^2 + 2409^2 .
It is a cyclic number.
It is not a de Polignac number, because 140827681 - 21 = 140827679 is a prime.
It is a super-2 number, since 2×1408276812 = 39664871471675522, which contains 22 as substring.
Together with 140827679, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 140827681.
It is not a weakly prime, because it can be changed into another prime (140827081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70413840 + 70413841.
It is an arithmetic number, because the mean of its divisors is an integer number (70413841).
Almost surely, 2140827681 is an apocalyptic number.
It is an amenable number.
140827681 is a deficient number, since it is larger than the sum of its proper divisors (1).
140827681 is an equidigital number, since it uses as much as digits as its factorization.
140827681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21504, while the sum is 37.
The square root of 140827681 is about 11867.0839299299. The cubic root of 140827681 is about 520.2706689989.
The spelling of 140827681 in words is "one hundred forty million, eight hundred twenty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •