Base | Representation |
---|---|
bin | 100000000101111000111010… |
… | …111000101110110011000011 |
3 | 200111202001200211010121011101 |
4 | 200011320322320232303003 |
5 | 121444433213011401202 |
6 | 1220103455534155231 |
7 | 41505121241412466 |
oct | 4005707270566303 |
9 | 614661624117141 |
10 | 141142203231427 |
11 | 40a770881776a2 |
12 | 139b637a352b17 |
13 | 609a863b61658 |
14 | 26bd4678012dd |
15 | 114b6750cd887 |
hex | 805e3ae2ecc3 |
141142203231427 has 2 divisors, whose sum is σ = 141142203231428. Its totient is φ = 141142203231426.
The previous prime is 141142203231389. The next prime is 141142203231487. The reversal of 141142203231427 is 724132302241141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141142203231427 - 223 = 141142194842819 is a prime.
It is a super-2 number, since 2×1411422032314272 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (141142203231487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70571101615713 + 70571101615714.
It is an arithmetic number, because the mean of its divisors is an integer number (70571101615714).
Almost surely, 2141142203231427 is an apocalyptic number.
141142203231427 is a deficient number, since it is larger than the sum of its proper divisors (1).
141142203231427 is an equidigital number, since it uses as much as digits as its factorization.
141142203231427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 37.
Adding to 141142203231427 its reverse (724132302241141), we get a palindrome (865274505472568).
The spelling of 141142203231427 in words is "one hundred forty-one trillion, one hundred forty-two billion, two hundred three million, two hundred thirty-one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •