Base | Representation |
---|---|
bin | 100000111011110… |
… | …1010111111110000 |
3 | 2212000110120010210 |
4 | 1001313222333300 |
5 | 4230402104242 |
6 | 301354224120 |
7 | 36246210000 |
oct | 10167527760 |
9 | 2760416123 |
10 | 1105113072 |
11 | 517897898 |
12 | 26a125040 |
13 | 147c5107b |
14 | a6ab0000 |
15 | 67045d9c |
hex | 41deaff0 |
1105113072 has 200 divisors, whose sum is σ = 3423225344. Its totient is φ = 307020672.
The previous prime is 1105113047. The next prime is 1105113137. The reversal of 1105113072 is 2703115011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4955553 + ... + 4955775.
Almost surely, 21105113072 is an apocalyptic number.
1105113072 is a gapful number since it is divisible by the number (12) 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 1105113072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1711612672).
1105113072 is an abundant number, since it is smaller than the sum of its proper divisors (2318112272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105113072 is an equidigital number, since it uses as much as digits as its factorization.
1105113072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305 (or 278 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 21.
The square root of 1105113072 is about 33243.2409972313. The cubic root of 1105113072 is about 1033.8770747296.
Adding to 1105113072 its reverse (2703115011), we get a palindrome (3808228083).
The spelling of 1105113072 in words is "one billion, one hundred five million, one hundred thirteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •