Base | Representation |
---|---|
bin | 100000001011111010010011… |
… | …011001010010101000010111 |
3 | 200120012121210101012120211101 |
4 | 200023322103121102220113 |
5 | 122023223144241202411 |
6 | 1221021533030450531 |
7 | 41550040523533612 |
oct | 4013722331225027 |
9 | 616177711176741 |
10 | 141556005022231 |
11 | 41116623528778 |
12 | 13a62603803a47 |
13 | 60ca89ba006c7 |
14 | 26d54c0a03179 |
15 | 11572e35068c1 |
hex | 80be93652a17 |
141556005022231 has 2 divisors, whose sum is σ = 141556005022232. Its totient is φ = 141556005022230.
The previous prime is 141556005022199. The next prime is 141556005022259. The reversal of 141556005022231 is 132220500655141.
It is a strong prime.
It is an emirp because it is prime and its reverse (132220500655141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141556005022231 - 25 = 141556005022199 is a prime.
It is a super-2 number, since 2×1415560050222312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141556005022291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70778002511115 + 70778002511116.
It is an arithmetic number, because the mean of its divisors is an integer number (70778002511116).
Almost surely, 2141556005022231 is an apocalyptic number.
141556005022231 is a deficient number, since it is larger than the sum of its proper divisors (1).
141556005022231 is an equidigital number, since it uses as much as digits as its factorization.
141556005022231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 141556005022231 its reverse (132220500655141), we get a palindrome (273776505677372).
The spelling of 141556005022231 in words is "one hundred forty-one trillion, five hundred fifty-six billion, five million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •