Base | Representation |
---|---|
bin | 100000111010110… |
… | …0010010011110000 |
3 | 2211222102010010210 |
4 | 1001311202103300 |
5 | 4230231200300 |
6 | 301334224120 |
7 | 36241355502 |
oct | 10165422360 |
9 | 2758363123 |
10 | 1104553200 |
11 | 517545193 |
12 | 269ab5040 |
13 | 147ab629a |
14 | a69a5d72 |
15 | 66e85050 |
hex | 41d624f0 |
1104553200 has 120 divisors (see below), whose sum is σ = 3560589568. Its totient is φ = 292688640.
The previous prime is 1104553199. The next prime is 1104553217. The reversal of 1104553200 is 23554011.
It is a tau number, because it is divible by the number of its divisors (120).
It is a congruent number.
It is an unprimeable number.
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, 192777 + ... + 198423.
Almost surely, 21104553200 is an apocalyptic number.
1104553200 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 1104553200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1780294784).
1104553200 is an abundant number, since it is smaller than the sum of its proper divisors (2456036368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104553200 is a wasteful number, since it uses less digits than its factorization.
1104553200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5831 (or 5820 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 1104553200 is about 33234.8190908270. The cubic root of 1104553200 is about 1033.7024510890.
The spelling of 1104553200 in words is "one billion, one hundred four million, five hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •