Base | Representation |
---|---|
bin | 1100111011000110001… |
… | …1011110111100101101 |
3 | 210020002002221102012102 |
4 | 3032301203132330231 |
5 | 12114200140414013 |
6 | 245555014144445 |
7 | 22016626400015 |
oct | 3166143367455 |
9 | 706062842172 |
10 | 222022201133 |
11 | 86182820927 |
12 | 37042952125 |
13 | 17c23945415 |
14 | aa62ba0c45 |
15 | 5b969dad58 |
hex | 33b18def2d |
222022201133 has 8 divisors (see below), whose sum is σ = 234228096000. Its totient is φ = 209868357888.
The previous prime is 222022201081. The next prime is 222022201189. The reversal of 222022201133 is 331102220222.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 222022201133 - 26 = 222022201069 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222022201033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13004141 + ... + 13021202.
It is an arithmetic number, because the mean of its divisors is an integer number (29278512000).
Almost surely, 2222022201133 is an apocalyptic number.
It is an amenable number.
222022201133 is a deficient number, since it is larger than the sum of its proper divisors (12205894867).
222022201133 is a wasteful number, since it uses less digits than its factorization.
222022201133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26025811.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 222022201133 its reverse (331102220222), we get a palindrome (553124421355).
The spelling of 222022201133 in words is "two hundred twenty-two billion, twenty-two million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •