Base | Representation |
---|---|
bin | 1100110111101111100… |
… | …1100110101000110101 |
3 | 210010202101002222201202 |
4 | 3031323321212220311 |
5 | 12110324214431013 |
6 | 245325420302245 |
7 | 21655416146534 |
oct | 3157371465065 |
9 | 703671088652 |
10 | 221122030133 |
11 | 85860692054 |
12 | 36a313a1985 |
13 | 17b0c2bbc64 |
14 | a9b93dc31b |
15 | 5b42978858 |
hex | 337be66a35 |
221122030133 has 4 divisors (see below), whose sum is σ = 221134915968. Its totient is φ = 221109144300.
The previous prime is 221122030117. The next prime is 221122030163. The reversal of 221122030133 is 331030221122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 221122030133 - 24 = 221122030117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221122030163) 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 3 ways as a sum of consecutive naturals, for example, 6417143 + ... + 6451508.
It is an arithmetic number, because the mean of its divisors is an integer number (55283728992).
Almost surely, 2221122030133 is an apocalyptic number.
It is an amenable number.
221122030133 is a deficient number, since it is larger than the sum of its proper divisors (12885835).
221122030133 is a wasteful number, since it uses less digits than its factorization.
221122030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12885834.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 221122030133 its reverse (331030221122), we get a palindrome (552152251255).
The spelling of 221122030133 in words is "two hundred twenty-one billion, one hundred twenty-two million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •