Base | Representation |
---|---|
bin | 11111111000001100011111… |
… | …001001111100100001001001 |
3 | 200101102002122111220112220121 |
4 | 133320030133021330201021 |
5 | 121334023413334103301 |
6 | 1214103303054223241 |
7 | 41350124644224463 |
oct | 3770143711744111 |
9 | 611362574815817 |
10 | 140201140144201 |
11 | 40743a73636684 |
12 | 13883b061b4b21 |
13 | 602cbabcc78c6 |
14 | 2689ab299b133 |
15 | 1131e47ac63a1 |
hex | 7f831f27c849 |
140201140144201 has 2 divisors, whose sum is σ = 140201140144202. Its totient is φ = 140201140144200.
The previous prime is 140201140144141. The next prime is 140201140144207. The reversal of 140201140144201 is 102441041102041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83409844144201 + 56791296000000 = 9132899^2 + 7536000^2 .
It is a cyclic number.
It is not a de Polignac number, because 140201140144201 - 213 = 140201140136009 is a prime.
It is not a weakly prime, because it can be changed into another prime (140201140144207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70100570072100 + 70100570072101.
It is an arithmetic number, because the mean of its divisors is an integer number (70100570072101).
Almost surely, 2140201140144201 is an apocalyptic number.
It is an amenable number.
140201140144201 is a deficient number, since it is larger than the sum of its proper divisors (1).
140201140144201 is an equidigital number, since it uses as much as digits as its factorization.
140201140144201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1024, while the sum is 25.
Adding to 140201140144201 its reverse (102441041102041), we get a palindrome (242642181246242).
The spelling of 140201140144201 in words is "one hundred forty trillion, two hundred one billion, one hundred forty million, one hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.471 sec. • engine limits •