Base | Representation |
---|---|
bin | 1001100110011110000111… |
… | …00000000100000001010001 |
3 | 2202202101110100112102002001 |
4 | 10303033003200010001101 |
5 | 10231404003310101113 |
6 | 112523110522354001 |
7 | 4306236626555161 |
oct | 463170340040121 |
9 | 82671410472061 |
10 | 21113044222033 |
11 | 67aaaa0058115 |
12 | 244ba2395b901 |
13 | ba1c4a67518a |
14 | 52dc3bcc25a1 |
15 | 2692eaac17dd |
hex | 1333c3804051 |
21113044222033 has 2 divisors, whose sum is σ = 21113044222034. Its totient is φ = 21113044222032.
The previous prime is 21113044222021. The next prime is 21113044222079. The reversal of 21113044222033 is 33022244031112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21092636099584 + 20408122449 = 4592672^2 + 142857^2 .
It is a cyclic number.
It is not a de Polignac number, because 21113044222033 - 237 = 20975605268561 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21113044221992 and 21113044222010.
It is not a weakly prime, because it can be changed into another prime (21113044222003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556522111016 + 10556522111017.
It is an arithmetic number, because the mean of its divisors is an integer number (10556522111017).
Almost surely, 221113044222033 is an apocalyptic number.
It is an amenable number.
21113044222033 is a deficient number, since it is larger than the sum of its proper divisors (1).
21113044222033 is an equidigital number, since it uses as much as digits as its factorization.
21113044222033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 21113044222033 its reverse (33022244031112), we get a palindrome (54135288253145).
The spelling of 21113044222033 in words is "twenty-one trillion, one hundred thirteen billion, forty-four million, two hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •