Base | Representation |
---|---|
bin | 1010010011100011101110… |
… | …0000011111100000000101 |
3 | 1111010020121101022012120101 |
4 | 2210320323200133200011 |
5 | 2441122114224201404 |
6 | 40033240131204101 |
7 | 2246434524455041 |
oct | 244707340374005 |
9 | 44106541265511 |
10 | 11331122100229 |
11 | 36795580297a8 |
12 | 1330069a46631 |
13 | 64269bc35a89 |
14 | 2b2601b75021 |
15 | 149b362412a4 |
hex | a4e3b81f805 |
11331122100229 has 2 divisors, whose sum is σ = 11331122100230. Its totient is φ = 11331122100228.
The previous prime is 11331122100209. The next prime is 11331122100241. The reversal of 11331122100229 is 92200122113311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10166723560900 + 1164398539329 = 3188530^2 + 1079073^2 .
It is an emirp because it is prime and its reverse (92200122113311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11331122100229 - 25 = 11331122100197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331122100197 and 11331122100206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331122100209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665561050114 + 5665561050115.
It is an arithmetic number, because the mean of its divisors is an integer number (5665561050115).
Almost surely, 211331122100229 is an apocalyptic number.
It is an amenable number.
11331122100229 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331122100229 is an equidigital number, since it uses as much as digits as its factorization.
11331122100229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 11331122100229 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-two million, one hundred thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •