Base | Representation |
---|---|
bin | 1100111011011000110… |
… | …0101001101111110101 |
3 | 210020021112112012021122 |
4 | 3032312030221233311 |
5 | 12114330111232013 |
6 | 250010435553325 |
7 | 22021563501440 |
oct | 3166614515765 |
9 | 706245465248 |
10 | 222100102133 |
11 | 86212799018 |
12 | 37064a5b845 |
13 | 17c36b1c2a0 |
14 | aa6d27c657 |
15 | 5b9d777a08 |
hex | 33b6329bf5 |
222100102133 has 8 divisors (see below), whose sum is σ = 273353971968. Its totient is φ = 175727553264.
The previous prime is 222100102111. The next prime is 222100102139. The reversal of 222100102133 is 331201001222.
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 222100102133 - 210 = 222100101109 is a prime.
It is a super-2 number, since 2×2221001021332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222100102139) 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, 1220330141 + ... + 1220330322.
It is an arithmetic number, because the mean of its divisors is an integer number (34169246496).
Almost surely, 2222100102133 is an apocalyptic number.
It is an amenable number.
222100102133 is a deficient number, since it is larger than the sum of its proper divisors (51253869835).
222100102133 is a wasteful number, since it uses less digits than its factorization.
222100102133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2440660483.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 222100102133 its reverse (331201001222), we get a palindrome (553301103355).
The spelling of 222100102133 in words is "two hundred twenty-two billion, one hundred million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •