Base | Representation |
---|---|
bin | 100100011001011… |
… | …1001101110100000 |
3 | 10011010002122000212 |
4 | 1020302321232200 |
5 | 10000123200300 |
6 | 321104433252 |
7 | 42156622505 |
oct | 11062715640 |
9 | 3133078025 |
10 | 1221303200 |
11 | 577437197 |
12 | 2a1018828 |
13 | 166042b20 |
14 | b82b74ac |
15 | 72347935 |
hex | 48cb9ba0 |
1221303200 has 144 divisors (see below), whose sum is σ = 3286727136. Its totient is φ = 440294400.
The previous prime is 1221303191. The next prime is 1221303227. The reversal of 1221303200 is 23031221.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 445835 + ... + 448565.
It is an arithmetic number, because the mean of its divisors is an integer number (22824494).
Almost surely, 21221303200 is an apocalyptic number.
1221303200 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 1221303200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1643363568).
1221303200 is an abundant number, since it is smaller than the sum of its proper divisors (2065423936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221303200 is a wasteful number, since it uses less digits than its factorization.
1221303200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2807 (or 2794 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1221303200 is about 34947.1486676667. The cubic root of 1221303200 is about 1068.9100614096.
Adding to 1221303200 its reverse (23031221), we get a palindrome (1244334421).
The spelling of 1221303200 in words is "one billion, two hundred twenty-one million, three hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •