Base | Representation |
---|---|
bin | 1010001000100011111011… |
… | …1100101001101110011001 |
3 | 1110110011222011101210011122 |
4 | 2202020332330221232121 |
5 | 2430023212010042021 |
6 | 35410353453535025 |
7 | 2226666063660215 |
oct | 242107674515631 |
9 | 43404864353148 |
10 | 11142201252761 |
11 | 3606421148907 |
12 | 12bb5247a4475 |
13 | 62a922065977 |
14 | 2a73dd289945 |
15 | 144c7a793bab |
hex | a223ef29b99 |
11142201252761 has 2 divisors, whose sum is σ = 11142201252762. Its totient is φ = 11142201252760.
The previous prime is 11142201252719. The next prime is 11142201252797. The reversal of 11142201252761 is 16725210224111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9906504451600 + 1235696801161 = 3147460^2 + 1111619^2 .
It is a cyclic number.
It is not a de Polignac number, because 11142201252761 - 226 = 11142134143897 is a prime.
It is not a weakly prime, because it can be changed into another prime (11142201252361) 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, 5571100626380 + 5571100626381.
It is an arithmetic number, because the mean of its divisors is an integer number (5571100626381).
Almost surely, 211142201252761 is an apocalyptic number.
It is an amenable number.
11142201252761 is a deficient number, since it is larger than the sum of its proper divisors (1).
11142201252761 is an equidigital number, since it uses as much as digits as its factorization.
11142201252761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13440, while the sum is 35.
Adding to 11142201252761 its reverse (16725210224111), we get a palindrome (27867411476872).
The spelling of 11142201252761 in words is "eleven trillion, one hundred forty-two billion, two hundred one million, two hundred fifty-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •