Base | Representation |
---|---|
bin | 100000111010011… |
… | …1111011001011000 |
3 | 2211222010211222111 |
4 | 1001310333121120 |
5 | 4230212111300 |
6 | 301331202104 |
7 | 36240221545 |
oct | 10164773130 |
9 | 2758124874 |
10 | 1104410200 |
11 | 517457803 |
12 | 269a46334 |
13 | 147a6617a |
14 | a6969bcc |
15 | 66e579ba |
hex | 41d3f658 |
1104410200 has 48 divisors (see below), whose sum is σ = 2580750000. Its totient is φ = 439528320.
The previous prime is 1104410191. The next prime is 1104410231. The reversal of 1104410200 is 20144011.
It is a congruent number.
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, 25926 + ... + 53674.
It is an arithmetic number, because the mean of its divisors is an integer number (53765625).
Almost surely, 21104410200 is an apocalyptic number.
1104410200 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 1104410200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1290375000).
1104410200 is an abundant number, since it is smaller than the sum of its proper divisors (1476339800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104410200 is a wasteful number, since it uses less digits than its factorization.
1104410200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27964 (or 27955 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 1104410200 is about 33232.6676630089. The cubic root of 1104410200 is about 1033.6578400403.
Adding to 1104410200 its reverse (20144011), we get a palindrome (1124554211).
The spelling of 1104410200 in words is "one billion, one hundred four million, four hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •