Base | Representation |
---|---|
bin | 10000101101111… |
… | …01010100100101 |
3 | 100202212201201111 |
4 | 20112331110211 |
5 | 241400023234 |
6 | 21525425021 |
7 | 3321662341 |
oct | 1026752445 |
9 | 322781644 |
10 | 140236069 |
11 | 72183486 |
12 | 3ab6b171 |
13 | 2309092c |
14 | 148a6621 |
15 | c4a1664 |
hex | 85bd525 |
140236069 has 2 divisors, whose sum is σ = 140236070. Its totient is φ = 140236068.
The previous prime is 140236027. The next prime is 140236073. The reversal of 140236069 is 960632041.
140236069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78535044 + 61701025 = 8862^2 + 7855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140236069 is a prime.
It is a super-2 number, since 2×1402360692 = 39332310097145522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140236069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140236469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70118034 + 70118035.
It is an arithmetic number, because the mean of its divisors is an integer number (70118035).
Almost surely, 2140236069 is an apocalyptic number.
It is an amenable number.
140236069 is a deficient number, since it is larger than the sum of its proper divisors (1).
140236069 is an equidigital number, since it uses as much as digits as its factorization.
140236069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 31.
The square root of 140236069 is about 11842.1311004397. The cubic root of 140236069 is about 519.5411003180.
The spelling of 140236069 in words is "one hundred forty million, two hundred thirty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •