Base | Representation |
---|---|
bin | 100001000000000… |
… | …1110011001110000 |
3 | 2212011200110211100 |
4 | 1002000032121300 |
5 | 4231440331443 |
6 | 301514244400 |
7 | 36304235646 |
oct | 10200163160 |
9 | 2764613740 |
10 | 1107355248 |
11 | 51908942a |
12 | 26aa26700 |
13 | 1485577bc |
14 | a70d5196 |
15 | 6733a3d3 |
hex | 4200e670 |
1107355248 has 120 divisors (see below), whose sum is σ = 3291807168. Its totient is φ = 346300416.
The previous prime is 1107355241. The next prime is 1107355267. The reversal of 1107355248 is 8425537011.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1107355241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1132936 + ... + 1133912.
Almost surely, 21107355248 is an apocalyptic number.
1107355248 is a gapful number since it is divisible by the number (18) 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 1107355248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1645903584).
1107355248 is an abundant number, since it is smaller than the sum of its proper divisors (2184451920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107355248 is a wasteful number, since it uses less digits than its factorization.
1107355248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1471 (or 1462 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The square root of 1107355248 is about 33276.9476965662. The cubic root of 1107355248 is about 1034.5758172156.
The spelling of 1107355248 in words is "one billion, one hundred seven million, three hundred fifty-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •