Base | Representation |
---|---|
bin | 100100010111101… |
… | …0001000010100000 |
3 | 10011001022012122022 |
4 | 1020233101002200 |
5 | 4444402200422 |
6 | 321032201012 |
7 | 42145543022 |
oct | 11057210240 |
9 | 3131265568 |
10 | 1220350112 |
11 | 576946113 |
12 | 2a0839168 |
13 | 165a9b077 |
14 | b810a012 |
15 | 7220a342 |
hex | 48bd10a0 |
1220350112 has 48 divisors (see below), whose sum is σ = 2473390080. Its totient is φ = 592397568.
The previous prime is 1220350063. The next prime is 1220350133. The reversal of 1220350112 is 2110530221.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187814 + ... + 194202.
It is an arithmetic number, because the mean of its divisors is an integer number (51528960).
Almost surely, 21220350112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1220350112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1236695040).
1220350112 is an abundant number, since it is smaller than the sum of its proper divisors (1253039968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220350112 is a wasteful number, since it uses less digits than its factorization.
1220350112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6573 (or 6565 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 1220350112 is about 34933.5098723275. The cubic root of 1220350112 is about 1068.6319348757.
Adding to 1220350112 its reverse (2110530221), we get a palindrome (3330880333).
The spelling of 1220350112 in words is "one billion, two hundred twenty million, three hundred fifty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •