Base | Representation |
---|---|
bin | 1100111011111000011… |
… | …1101111100110101101 |
3 | 210020121210122210100000 |
4 | 3032332013233212231 |
5 | 12120113124030013 |
6 | 250031545054513 |
7 | 22025066420406 |
oct | 3167607574655 |
9 | 706553583300 |
10 | 222233033133 |
11 | 86280832051 |
12 | 370a1487439 |
13 | 17c58522b97 |
14 | aa82ba29ad |
15 | 5baa284973 |
hex | 33be1ef9ad |
222233033133 has 12 divisors (see below), whose sum is σ = 332892280448. Its totient is φ = 148155355260.
The previous prime is 222233033123. The next prime is 222233033159. The reversal of 222233033133 is 331330332222.
222233033133 is a `hidden beast` number, since 2 + 2 + 223 + 303 + 3 + 133 = 666.
It is not a de Polignac number, because 222233033133 - 217 = 222232902061 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 222233033097 and 222233033106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222233033123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 457269373 + ... + 457269858.
Almost surely, 2222233033133 is an apocalyptic number.
It is an amenable number.
222233033133 is a deficient number, since it is larger than the sum of its proper divisors (110659247315).
222233033133 is an frugal number, since it uses more digits than its factorization.
222233033133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914539246 (or 914539234 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 27.
Adding to 222233033133 its reverse (331330332222), we get a palindrome (553563365355).
The spelling of 222233033133 in words is "two hundred twenty-two billion, two hundred thirty-three million, thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •