Base | Representation |
---|---|
bin | 1000001010100100001… |
… | …1100011101110101111 |
3 | 111102002000121022020012 |
4 | 2002221003203232233 |
5 | 4244240430021014 |
6 | 144235213043435 |
7 | 13064102554631 |
oct | 2025103435657 |
9 | 442060538205 |
10 | 140275235759 |
11 | 5454379390a |
12 | 23229a8657b |
13 | 102c68cbca9 |
14 | 6b09dd6a51 |
15 | 39aee8cc3e |
hex | 20a90e3baf |
140275235759 has 2 divisors, whose sum is σ = 140275235760. Its totient is φ = 140275235758.
The previous prime is 140275235699. The next prime is 140275235761. The reversal of 140275235759 is 957532572041.
140275235759 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 is an emirp because it is prime and its reverse (957532572041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140275235759 is a prime.
Together with 140275235761, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140275238759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70137617879 + 70137617880.
It is an arithmetic number, because the mean of its divisors is an integer number (70137617880).
Almost surely, 2140275235759 is an apocalyptic number.
140275235759 is a deficient number, since it is larger than the sum of its proper divisors (1).
140275235759 is an equidigital number, since it uses as much as digits as its factorization.
140275235759 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2646000, while the sum is 50.
The spelling of 140275235759 in words is "one hundred forty billion, two hundred seventy-five million, two hundred thirty-five thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •