Base | Representation |
---|---|
bin | 1010001101001010010011… |
… | …1101101100001000100101 |
3 | 1110201201221021021102220121 |
4 | 2203102210331230020211 |
5 | 2432322030341242013 |
6 | 35510542555201541 |
7 | 2235464230024033 |
oct | 243224475541045 |
9 | 43651837242817 |
10 | 11221222212133 |
11 | 36369914471aa |
12 | 13128b87462b1 |
13 | 6352063bb5ab |
14 | 2ab177db1553 |
15 | 146d52d2158d |
hex | a34a4f6c225 |
11221222212133 has 2 divisors, whose sum is σ = 11221222212134. Its totient is φ = 11221222212132.
The previous prime is 11221222212107. The next prime is 11221222212223. The reversal of 11221222212133 is 33121222212211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10464073371684 + 757148840449 = 3234822^2 + 870143^2 .
It is a cyclic number.
It is not a de Polignac number, because 11221222212133 - 29 = 11221222211621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11221222212098 and 11221222212107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11221222212103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610611106066 + 5610611106067.
It is an arithmetic number, because the mean of its divisors is an integer number (5610611106067).
Almost surely, 211221222212133 is an apocalyptic number.
It is an amenable number.
11221222212133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11221222212133 is an equidigital number, since it uses as much as digits as its factorization.
11221222212133 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1152, while the sum is 25.
Adding to 11221222212133 its reverse (33121222212211), we get a palindrome (44342444424344).
The spelling of 11221222212133 in words is "eleven trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •