Base | Representation |
---|---|
bin | 1010001101101011000101… |
… | …1110101110010110111101 |
3 | 1110202120122112212202012101 |
4 | 2203122301132232112331 |
5 | 2432443041131230211 |
6 | 35515000112105101 |
7 | 2236225263101365 |
oct | 243326136562675 |
9 | 43676575782171 |
10 | 11230022133181 |
11 | 363a697801125 |
12 | 1314553835191 |
13 | 635ca9587677 |
14 | 2ab7709c39a5 |
15 | 1471ba67a5c1 |
hex | a36b17ae5bd |
11230022133181 has 2 divisors, whose sum is σ = 11230022133182. Its totient is φ = 11230022133180.
The previous prime is 11230022132999. The next prime is 11230022133227. The reversal of 11230022133181 is 18133122003211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6935453925625 + 4294568207556 = 2633525^2 + 2072334^2 .
It is a cyclic number.
It is not a de Polignac number, because 11230022133181 - 29 = 11230022132669 is a prime.
It is a super-2 number, since 2×112300221331812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11230023133181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615011066590 + 5615011066591.
It is an arithmetic number, because the mean of its divisors is an integer number (5615011066591).
Almost surely, 211230022133181 is an apocalyptic number.
It is an amenable number.
11230022133181 is a deficient number, since it is larger than the sum of its proper divisors (1).
11230022133181 is an equidigital number, since it uses as much as digits as its factorization.
11230022133181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 11230022133181 its reverse (18133122003211), we get a palindrome (29363144136392).
The spelling of 11230022133181 in words is "eleven trillion, two hundred thirty billion, twenty-two million, one hundred thirty-three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •