Base | Representation |
---|---|
bin | 1010000011110111101110… |
… | …11100110100010011101001 |
3 | 2220022221221011010111221222 |
4 | 11001323313130310103221 |
5 | 10344431340133213113 |
6 | 115015134544111425 |
7 | 4442231224424621 |
oct | 501736734642351 |
9 | 86287834114858 |
10 | 22123233101033 |
11 | 705a457374669 |
12 | 259376a005575 |
13 | c4629a7c05ac |
14 | 566aad5b7881 |
15 | 285721aa4e08 |
hex | 141ef77344e9 |
22123233101033 has 2 divisors, whose sum is σ = 22123233101034. Its totient is φ = 22123233101032.
The previous prime is 22123233101027. The next prime is 22123233101041. The reversal of 22123233101033 is 33010133232122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12453297539929 + 9669935561104 = 3528923^2 + 3109652^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22123233101033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22123233100993 and 22123233101011.
It is not a weakly prime, because it can be changed into another prime (22123233101023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11061616550516 + 11061616550517.
It is an arithmetic number, because the mean of its divisors is an integer number (11061616550517).
Almost surely, 222123233101033 is an apocalyptic number.
It is an amenable number.
22123233101033 is a deficient number, since it is larger than the sum of its proper divisors (1).
22123233101033 is an equidigital number, since it uses as much as digits as its factorization.
22123233101033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 22123233101033 its reverse (33010133232122), we get a palindrome (55133366333155).
The spelling of 22123233101033 in words is "twenty-two trillion, one hundred twenty-three billion, two hundred thirty-three million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •