Base | Representation |
---|---|
bin | 11010011101110… |
… | …10011100011101 |
3 | 120110202102212121 |
4 | 31032322130131 |
5 | 423313410323 |
6 | 34010302541 |
7 | 5334036562 |
oct | 1516723435 |
9 | 513672777 |
10 | 222013213 |
11 | 1043588a4 |
12 | 62427a51 |
13 | 36cc3b86 |
14 | 216b2869 |
15 | 14756a5d |
hex | d3ba71d |
222013213 has 4 divisors (see below), whose sum is σ = 222047548. Its totient is φ = 221978880.
The previous prime is 222013199. The next prime is 222013219. The reversal of 222013213 is 312310222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 92121604 + 129891609 = 9598^2 + 11397^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222013213 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 (222013219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4206 + ... + 21487.
It is an arithmetic number, because the mean of its divisors is an integer number (55511887).
Almost surely, 2222013213 is an apocalyptic number.
It is an amenable number.
222013213 is a deficient number, since it is larger than the sum of its proper divisors (34335).
222013213 is an equidigital number, since it uses as much as digits as its factorization.
222013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34334.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 222013213 is about 14900.1078184019. The cubic root of 222013213 is about 605.5169072299.
Adding to 222013213 its reverse (312310222), we get a palindrome (534323435).
The spelling of 222013213 in words is "two hundred twenty-two million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.321 sec. • engine limits •