Base | Representation |
---|---|
bin | 11111111100110110100011… |
… | …100110101001101001000101 |
3 | 200102112200202022212201202022 |
4 | 133330312203212221221011 |
5 | 121404244344044411402 |
6 | 1214510313214052525 |
7 | 41412215036611064 |
oct | 3774664346515105 |
9 | 612480668781668 |
10 | 140521189841477 |
11 | 4085777a316225 |
12 | 13915b461aa145 |
13 | 60541258b17c3 |
14 | 269b3948401db |
15 | 113a42a56b2a2 |
hex | 7fcda39a9a45 |
140521189841477 has 2 divisors, whose sum is σ = 140521189841478. Its totient is φ = 140521189841476.
The previous prime is 140521189841377. The next prime is 140521189841479. The reversal of 140521189841477 is 774148981125041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139738547063236 + 782642778241 = 11821106^2 + 884671^2 .
It is a cyclic number.
It is not a de Polignac number, because 140521189841477 - 210 = 140521189840453 is a prime.
Together with 140521189841479, 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 (140521189841479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70260594920738 + 70260594920739.
It is an arithmetic number, because the mean of its divisors is an integer number (70260594920739).
Almost surely, 2140521189841477 is an apocalyptic number.
It is an amenable number.
140521189841477 is a deficient number, since it is larger than the sum of its proper divisors (1).
140521189841477 is an equidigital number, since it uses as much as digits as its factorization.
140521189841477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18063360, while the sum is 62.
The spelling of 140521189841477 in words is "one hundred forty trillion, five hundred twenty-one billion, one hundred eighty-nine million, eight hundred forty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •