Base | Representation |
---|---|
bin | 100100010111001… |
… | …0110101101101110 |
3 | 10011000212001221020 |
4 | 1020232112231232 |
5 | 4444322024324 |
6 | 321023115010 |
7 | 42143526360 |
oct | 11056265556 |
9 | 3130761836 |
10 | 1220111214 |
11 | 5767a2683 |
12 | 2a0742a66 |
13 | 165a163ca |
14 | b8086d30 |
15 | 721ae679 |
hex | 48b96b6e |
1220111214 has 16 divisors (see below), whose sum is σ = 2788825728. Its totient is φ = 348603192.
The previous prime is 1220111183. The next prime is 1220111219. The reversal of 1220111214 is 4121110221.
It is a junction number, because it is equal to n+sod(n) for n = 1220111193 and 1220111202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220111219) 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, 14525092 + ... + 14525175.
It is an arithmetic number, because the mean of its divisors is an integer number (174301608).
Almost surely, 21220111214 is an apocalyptic number.
1220111214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1220111214 is an abundant number, since it is smaller than the sum of its proper divisors (1568714514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220111214 is a wasteful number, since it uses less digits than its factorization.
1220111214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29050279.
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 1220111214 is about 34930.0903806446. The cubic root of 1220111214 is about 1068.5621978687.
Adding to 1220111214 its reverse (4121110221), we get a palindrome (5341221435).
The spelling of 1220111214 in words is "one billion, two hundred twenty million, one hundred eleven thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •