Base | Representation |
---|---|
bin | 100001101110010000000 |
3 | 2002010210211 |
4 | 10031302000 |
5 | 240330044 |
6 | 35403504 |
7 | 12251434 |
oct | 4156200 |
9 | 2063724 |
10 | 1105024 |
11 | 695248 |
12 | 453594 |
13 | 2c8c7b |
14 | 20a9c4 |
15 | 16c634 |
hex | 10dc80 |
1105024 has 32 divisors (see below), whose sum is σ = 2249100. Its totient is φ = 540672.
The previous prime is 1105019. The next prime is 1105033. The reversal of 1105024 is 4205011.
It can be written as a sum of positive squares in 2 ways, for example, as 1065024 + 40000 = 1032^2 + 200^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 1104995 and 1105013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11344 + ... + 11440.
21105024 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1105024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1124550).
1105024 is an abundant number, since it is smaller than the sum of its proper divisors (1144076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105024 is an frugal number, since it uses more digits than its factorization.
1105024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200 (or 188 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 1105024 is about 1051.2012176553. The cubic root of 1105024 is about 103.3849297188.
Subtracting from 1105024 its sum of digits (13), we obtain a palindrome (1105011).
The spelling of 1105024 in words is "one million, one hundred five thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •