Base | Representation |
---|---|
bin | 1010001000000010001011… |
… | …1110110011111011110101 |
3 | 1110102022120211001021022121 |
4 | 2202000202332303323311 |
5 | 2424401133340402404 |
6 | 35402254521155541 |
7 | 2226225432433021 |
oct | 242004276637365 |
9 | 43368524037277 |
10 | 11133142122229 |
11 | 36025a253aa76 |
12 | 12b981692bbb1 |
13 | 629b0a2813ba |
14 | 2a6bc0081381 |
15 | 1448ea2d6e54 |
hex | a2022fb3ef5 |
11133142122229 has 2 divisors, whose sum is σ = 11133142122230. Its totient is φ = 11133142122228.
The previous prime is 11133142122217. The next prime is 11133142122251. The reversal of 11133142122229 is 92222124133111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10502590192900 + 630551929329 = 3240770^2 + 794073^2 .
It is a cyclic number.
It is not a de Polignac number, because 11133142122229 - 243 = 2337049100021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11133142122194 and 11133142122203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11133142129229) 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, 5566571061114 + 5566571061115.
It is an arithmetic number, because the mean of its divisors is an integer number (5566571061115).
Almost surely, 211133142122229 is an apocalyptic number.
It is an amenable number.
11133142122229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11133142122229 is an equidigital number, since it uses as much as digits as its factorization.
11133142122229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 34.
The spelling of 11133142122229 in words is "eleven trillion, one hundred thirty-three billion, one hundred forty-two million, one hundred twenty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •