Base | Representation |
---|---|
bin | 1010000000111001110111… |
… | …10101001000110101000101 |
3 | 2212222012211100002222011211 |
4 | 11000130323311020311011 |
5 | 10341244111041042013 |
6 | 114500240203531421 |
7 | 4431662241005461 |
oct | 500347365106505 |
9 | 85865740088154 |
10 | 22021301112133 |
11 | 70201aa424724 |
12 | 2577a61229b71 |
13 | c397a4959c6b |
14 | 561b9db234a1 |
15 | 282c57e3e23d |
hex | 14073bd48d45 |
22021301112133 has 4 divisors (see below), whose sum is σ = 23180316960160. Its totient is φ = 20862285264108.
The previous prime is 22021301112113. The next prime is 22021301112137. The reversal of 22021301112133 is 33121110312022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 22021301112133 - 217 = 22021300981061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22021301112137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 579507923985 + ... + 579507924022.
It is an arithmetic number, because the mean of its divisors is an integer number (5795079240040).
Almost surely, 222021301112133 is an apocalyptic number.
It is an amenable number.
22021301112133 is a deficient number, since it is larger than the sum of its proper divisors (1159015848027).
22021301112133 is a wasteful number, since it uses less digits than its factorization.
22021301112133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1159015848026.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 22021301112133 its reverse (33121110312022), we get a palindrome (55142411424155).
The spelling of 22021301112133 in words is "twenty-two trillion, twenty-one billion, three hundred one million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •