Base | Representation |
---|---|
bin | 100100010111001… |
… | …0110111101010011 |
3 | 10011000212010022011 |
4 | 1020232112331103 |
5 | 4444322042321 |
6 | 321023123351 |
7 | 42143532313 |
oct | 11056267523 |
9 | 3130763264 |
10 | 1220112211 |
11 | 5767a33aa |
12 | 2a0743557 |
13 | 165a169b6 |
14 | b8087443 |
15 | 721aeae1 |
hex | 48b96f53 |
1220112211 has 8 divisors (see below), whose sum is σ = 1279628064. Its totient is φ = 1161135360.
The previous prime is 1220112203. The next prime is 1220112221. The reversal of 1220112211 is 1122110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1220112211 - 23 = 1220112203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220112191 and 1220112200.
It is not an unprimeable number, because it can be changed into a prime (1220112221) 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 7 ways as a sum of consecutive naturals, for example, 130110 + ... + 139171.
It is an arithmetic number, because the mean of its divisors is an integer number (159953508).
Almost surely, 21220112211 is an apocalyptic number.
1220112211 is a deficient number, since it is larger than the sum of its proper divisors (59515853).
1220112211 is a wasteful number, since it uses less digits than its factorization.
1220112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269501.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 1220112211 is about 34930.1046520047. The cubic root of 1220112211 is about 1068.5624889231.
Adding to 1220112211 its reverse (1122110221), we get a palindrome (2342222432).
The spelling of 1220112211 in words is "one billion, two hundred twenty million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •