Base | Representation |
---|---|
bin | 1100111011111000001… |
… | …1111000100001111001 |
3 | 210020121201202101002210 |
4 | 3032332003320201321 |
5 | 12120112344133423 |
6 | 250031511245333 |
7 | 22025055004044 |
oct | 3167603704171 |
9 | 706551671083 |
10 | 222232021113 |
11 | 86280200773 |
12 | 370a1079849 |
13 | 17c5825a35b |
14 | aa829bbc5b |
15 | 5baa134b93 |
hex | 33be0f8879 |
222232021113 has 4 divisors (see below), whose sum is σ = 296309361488. Its totient is φ = 148154680740.
The previous prime is 222232021111. The next prime is 222232021163. The reversal of 222232021113 is 311120232222.
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 not a de Polignac number, because 222232021113 - 21 = 222232021111 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 222232021113.
It is not an unprimeable number, because it can be changed into a prime (222232021111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37038670183 + ... + 37038670188.
It is an arithmetic number, because the mean of its divisors is an integer number (74077340372).
Almost surely, 2222232021113 is an apocalyptic number.
It is an amenable number.
222232021113 is a deficient number, since it is larger than the sum of its proper divisors (74077340375).
222232021113 is an equidigital number, since it uses as much as digits as its factorization.
222232021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74077340374.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 222232021113 its reverse (311120232222), we get a palindrome (533352253335).
The spelling of 222232021113 in words is "two hundred twenty-two billion, two hundred thirty-two million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •