Base | Representation |
---|---|
bin | 1100111011011101110… |
… | …0011101001100010111 |
3 | 210020022222220001021002 |
4 | 3032313130131030113 |
5 | 12114400440202411 |
6 | 250012504213515 |
7 | 22022236352123 |
oct | 3166734351427 |
9 | 706288801232 |
10 | 222121022231 |
11 | 86223587659 |
12 | 3706ba6a29b |
13 | 17c3b265444 |
14 | aa71d66583 |
15 | 5ba050b33b |
hex | 33b771d317 |
222121022231 has 4 divisors (see below), whose sum is σ = 222726256992. Its totient is φ = 221515787472.
The previous prime is 222121022209. The next prime is 222121022281. The reversal of 222121022231 is 132220121222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222121022231 - 230 = 221047280407 is a prime.
It is a super-2 number, since 2×2221210222312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222121022281) 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, 302616830 + ... + 302617563.
It is an arithmetic number, because the mean of its divisors is an integer number (55681564248).
Almost surely, 2222121022231 is an apocalyptic number.
222121022231 is a deficient number, since it is larger than the sum of its proper divisors (605234761).
222121022231 is an equidigital number, since it uses as much as digits as its factorization.
222121022231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 605234760.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 222121022231 its reverse (132220121222), we get a palindrome (354341143453).
The spelling of 222121022231 in words is "two hundred twenty-two billion, one hundred twenty-one million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •