Base | Representation |
---|---|
bin | 100100011001110… |
… | …0101101001110000 |
3 | 10011010102202211120 |
4 | 1020303211221300 |
5 | 10000144424440 |
6 | 321112342240 |
7 | 42161302164 |
oct | 11063455160 |
9 | 3133382746 |
10 | 1221483120 |
11 | 57754a390 |
12 | 2a10a4980 |
13 | 1660a69a0 |
14 | b8322ca4 |
15 | 72380dd0 |
hex | 48ce5a70 |
1221483120 has 160 divisors (see below), whose sum is σ = 4448715264. Its totient is φ = 273331200.
The previous prime is 1221483113. The next prime is 1221483121. The reversal of 1221483120 is 213841221.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221483121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16525 + ... + 52115.
Almost surely, 21221483120 is an apocalyptic number.
1221483120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1221483120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2224357632).
1221483120 is an abundant number, since it is smaller than the sum of its proper divisors (3227232144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221483120 is a wasteful number, since it uses less digits than its factorization.
1221483120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35631 (or 35625 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
The square root of 1221483120 is about 34949.7227456814. The cubic root of 1221483120 is about 1068.9625487458.
The spelling of 1221483120 in words is "one billion, two hundred twenty-one million, four hundred eighty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •