Base | Representation |
---|---|
bin | 100100011011001… |
… | …1110111101011101 |
3 | 10011011212100000110 |
4 | 1020312132331131 |
5 | 10000343222031 |
6 | 321140520233 |
7 | 42200613111 |
oct | 11066367535 |
9 | 3134770013 |
10 | 1222242141 |
11 | 577a1867a |
12 | 2a13b0079 |
13 | 1662b1303 |
14 | b847d741 |
15 | 72480c46 |
hex | 48d9ef5d |
1222242141 has 4 divisors (see below), whose sum is σ = 1629656192. Its totient is φ = 814828092.
The previous prime is 1222242121. The next prime is 1222242143. The reversal of 1222242141 is 1412422221.
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 1222242141 - 211 = 1222240093 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 (1222242143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 203707021 + ... + 203707026.
It is an arithmetic number, because the mean of its divisors is an integer number (407414048).
Almost surely, 21222242141 is an apocalyptic number.
It is an amenable number.
1222242141 is a deficient number, since it is larger than the sum of its proper divisors (407414051).
1222242141 is an equidigital number, since it uses as much as digits as its factorization.
1222242141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407414050.
The product of its digits is 512, while the sum is 21.
The square root of 1222242141 is about 34960.5798149859. The cubic root of 1222242141 is about 1069.1839181637.
Adding to 1222242141 its reverse (1412422221), we get a palindrome (2634664362).
The spelling of 1222242141 in words is "one billion, two hundred twenty-two million, two hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •