Base | Representation |
---|---|
bin | 1000001011011110101… |
… | …0010000010111001111 |
3 | 111102201002122212202202 |
4 | 2002313222100113033 |
5 | 4300241141323241 |
6 | 144315404512115 |
7 | 13103136340301 |
oct | 2026752202717 |
9 | 442632585682 |
10 | 140520261071 |
11 | 5465a029a73 |
12 | 23297b4b63b |
13 | 103355bc298 |
14 | 6b30779971 |
15 | 39c673cd9b |
hex | 20b7a905cf |
140520261071 has 2 divisors, whose sum is σ = 140520261072. Its totient is φ = 140520261070.
The previous prime is 140520261067. The next prime is 140520261103. The reversal of 140520261071 is 170162025041.
140520261071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (170162025041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140520261071 - 22 = 140520261067 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140520291071) 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, 70260130535 + 70260130536.
It is an arithmetic number, because the mean of its divisors is an integer number (70260130536).
Almost surely, 2140520261071 is an apocalyptic number.
140520261071 is a deficient number, since it is larger than the sum of its proper divisors (1).
140520261071 is an equidigital number, since it uses as much as digits as its factorization.
140520261071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
The spelling of 140520261071 in words is "one hundred forty billion, five hundred twenty million, two hundred sixty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •