Base | Representation |
---|---|
bin | 100001101110101111000 |
3 | 2002011011000 |
4 | 10031311320 |
5 | 240332042 |
6 | 35405000 |
7 | 12252240 |
oct | 4156570 |
9 | 2064130 |
10 | 1105272 |
11 | 695453 |
12 | 453760 |
13 | 2c910c |
14 | 20ab20 |
15 | 16c74c |
hex | 10dd78 |
1105272 has 128 divisors (see below), whose sum is σ = 3801600. Its totient is φ = 290304.
The previous prime is 1105271. The next prime is 1105309. The reversal of 1105272 is 2725011.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25683 + ... + 25725.
It is an arithmetic number, because the mean of its divisors is an integer number (29700).
21105272 is an apocalyptic number.
1105272 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 1105272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1900800).
1105272 is an abundant number, since it is smaller than the sum of its proper divisors (2696328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105272 is a wasteful number, since it uses less digits than its factorization.
1105272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82 (or 72 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 1105272 is about 1051.3191713271. The cubic root of 1105272 is about 103.3926633501.
The spelling of 1105272 in words is "one million, one hundred five thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •