Base | Representation |
---|---|
bin | 11111111000010000010001… |
… | …100110011110011110000101 |
3 | 200101102111010222202021121221 |
4 | 133320100101212132132011 |
5 | 121334110231133201243 |
6 | 1214105214440240341 |
7 | 41350330515034606 |
oct | 3770202146363605 |
9 | 611374128667557 |
10 | 140205207709573 |
11 | 40745770678756 |
12 | 138848604700b1 |
13 | 60303a9914916 |
14 | 2689d7ac9bdad |
15 | 11320d4c45bed |
hex | 7f841199e785 |
140205207709573 has 2 divisors, whose sum is σ = 140205207709574. Its totient is φ = 140205207709572.
The previous prime is 140205207709561. The next prime is 140205207709591. The reversal of 140205207709573 is 375907702502041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134045290750849 + 6159916958724 = 11577793^2 + 2481918^2 .
It is a cyclic number.
It is not a de Polignac number, because 140205207709573 - 221 = 140205205612421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140205207709573.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140205207709513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70102603854786 + 70102603854787.
It is an arithmetic number, because the mean of its divisors is an integer number (70102603854787).
Almost surely, 2140205207709573 is an apocalyptic number.
It is an amenable number.
140205207709573 is a deficient number, since it is larger than the sum of its proper divisors (1).
140205207709573 is an equidigital number, since it uses as much as digits as its factorization.
140205207709573 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3704400, while the sum is 52.
The spelling of 140205207709573 in words is "one hundred forty trillion, two hundred five billion, two hundred seven million, seven hundred nine thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •