Base | Representation |
---|---|
bin | 1010000001001010000111… |
… | …01101101001100000001101 |
3 | 2220000001100012110002010212 |
4 | 11000211003231221200031 |
5 | 10341414441431114013 |
6 | 114504241502412205 |
7 | 4432421341254101 |
oct | 500450355514015 |
9 | 86001305402125 |
10 | 22030023301133 |
11 | 7023975917391 |
12 | 2579696291065 |
13 | c3a5649ab043 |
14 | 56238a29d901 |
15 | 2830b8a416a8 |
hex | 140943b6980d |
22030023301133 has 2 divisors, whose sum is σ = 22030023301134. Its totient is φ = 22030023301132.
The previous prime is 22030023301061. The next prime is 22030023301157. The reversal of 22030023301133 is 33110332003022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21130450723369 + 899572577764 = 4596787^2 + 948458^2 .
It is a cyclic number.
It is not a de Polignac number, because 22030023301133 - 214 = 22030023284749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22030023301099 and 22030023301108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22030023301733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11015011650566 + 11015011650567.
It is an arithmetic number, because the mean of its divisors is an integer number (11015011650567).
Almost surely, 222030023301133 is an apocalyptic number.
It is an amenable number.
22030023301133 is a deficient number, since it is larger than the sum of its proper divisors (1).
22030023301133 is an equidigital number, since it uses as much as digits as its factorization.
22030023301133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 22030023301133 its reverse (33110332003022), we get a palindrome (55140355304155).
The spelling of 22030023301133 in words is "twenty-two trillion, thirty billion, twenty-three million, three hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •