Base | Representation |
---|---|
bin | 1000001101110001000… |
… | …1001010111010010011 |
3 | 111111021220100111210102 |
4 | 2003130101022322103 |
5 | 4303020404122011 |
6 | 144500344523015 |
7 | 13124304651524 |
oct | 2033421127223 |
9 | 444256314712 |
10 | 141134442131 |
11 | 54944793321 |
12 | 2342978046b |
13 | 10402911827 |
14 | 6b8c17484b |
15 | 3a1060c73b |
hex | 20dc44ae93 |
141134442131 has 2 divisors, whose sum is σ = 141134442132. Its totient is φ = 141134442130.
The previous prime is 141134442091. The next prime is 141134442149. The reversal of 141134442131 is 131244431141.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141134442131 is a prime.
It is a super-2 number, since 2×1411344421312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 141134442094 and 141134442103.
It is not a weakly prime, because it can be changed into another prime (141134442931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70567221065 + 70567221066.
It is an arithmetic number, because the mean of its divisors is an integer number (70567221066).
Almost surely, 2141134442131 is an apocalyptic number.
141134442131 is a deficient number, since it is larger than the sum of its proper divisors (1).
141134442131 is an equidigital number, since it uses as much as digits as its factorization.
141134442131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4608, while the sum is 29.
Adding to 141134442131 its reverse (131244431141), we get a palindrome (272378873272).
The spelling of 141134442131 in words is "one hundred forty-one billion, one hundred thirty-four million, four hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •