Base | Representation |
---|---|
bin | 1010000000111011010111… |
… | …00000100000101010111101 |
3 | 2212222021220002021001022201 |
4 | 11000131223200200222331 |
5 | 10341302230324324013 |
6 | 114500451420311501 |
7 | 4432021123021516 |
oct | 500355340405275 |
9 | 85867802231281 |
10 | 22022101011133 |
11 | 702057a9a6683 |
12 | 25780450a2591 |
13 | c398a15a5b92 |
14 | 561c38063a0d |
15 | 282ca32963dd |
hex | 14076b820abd |
22022101011133 has 2 divisors, whose sum is σ = 22022101011134. Its totient is φ = 22022101011132.
The previous prime is 22022101011077. The next prime is 22022101011227. The reversal of 22022101011133 is 33111010122022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11683284558724 + 10338816452409 = 3418082^2 + 3215403^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022101011133 - 221 = 22022098913981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22022101011133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22022101015133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011050505566 + 11011050505567.
It is an arithmetic number, because the mean of its divisors is an integer number (11011050505567).
Almost surely, 222022101011133 is an apocalyptic number.
It is an amenable number.
22022101011133 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022101011133 is an equidigital number, since it uses as much as digits as its factorization.
22022101011133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 22022101011133 its reverse (33111010122022), we get a palindrome (55133111133155).
The spelling of 22022101011133 in words is "twenty-two trillion, twenty-two billion, one hundred one million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •