Base | Representation |
---|---|
bin | 100100010111000… |
… | …0011011011001000 |
3 | 10011000201001112210 |
4 | 1020232003123020 |
5 | 4444312012300 |
6 | 321021305120 |
7 | 42143050122 |
oct | 11056033310 |
9 | 3130631483 |
10 | 1220032200 |
11 | 576749282 |
12 | 2a07051a0 |
13 | 1659b945a |
14 | b8066212 |
15 | 72196050 |
hex | 48b836c8 |
1220032200 has 96 divisors (see below), whose sum is σ = 4004609760. Its totient is φ = 306201600.
The previous prime is 1220032181. The next prime is 1220032207. The reversal of 1220032200 is 22300221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (1220032207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 49606 + ... + 70005.
It is an arithmetic number, because the mean of its divisors is an integer number (41714685).
Almost surely, 21220032200 is an apocalyptic number.
1220032200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1220032200 is an abundant number, since it is smaller than the sum of its proper divisors (2784577560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220032200 is a wasteful number, since it uses less digits than its factorization.
1220032200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119647 (or 119638 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 1220032200 is about 34928.9593317637. The cubic root of 1220032200 is about 1068.5391307922.
Adding to 1220032200 its reverse (22300221), we get a palindrome (1242332421).
The spelling of 1220032200 in words is "one billion, two hundred twenty million, thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •