Base | Representation |
---|---|
bin | 100100010111011… |
… | …0100000000100000 |
3 | 10011001002011112011 |
4 | 1020232310000200 |
5 | 4444334344300 |
6 | 321025442304 |
7 | 42144536236 |
oct | 11056640040 |
9 | 3131064464 |
10 | 1220231200 |
11 | 576874841 |
12 | 2a07a0394 |
13 | 165a58bc6 |
14 | b80b8956 |
15 | 721d4eba |
hex | 48bb4020 |
1220231200 has 72 divisors (see below), whose sum is σ = 2991722580. Its totient is φ = 485990400.
The previous prime is 1220231171. The next prime is 1220231227. The reversal of 1220231200 is 21320221.
It can be written as a sum of positive squares in 6 ways, for example, as 765518224 + 454712976 = 27668^2 + 21324^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 189636 + ... + 195964.
Almost surely, 21220231200 is an apocalyptic number.
1220231200 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 1220231200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1495861290).
1220231200 is an abundant number, since it is smaller than the sum of its proper divisors (1771491380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220231200 is a wasteful number, since it uses less digits than its factorization.
1220231200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6590 (or 6577 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 1220231200 is about 34931.8078547332. The cubic root of 1220231200 is about 1068.5972242663.
Adding to 1220231200 its reverse (21320221), we get a palindrome (1241551421).
The spelling of 1220231200 in words is "one billion, two hundred twenty million, two hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •