Base | Representation |
---|---|
bin | 101100001000… |
… | …101110111000 |
3 | 210202211012101 |
4 | 230020232320 |
5 | 10430220404 |
6 | 1051553144 |
7 | 200226040 |
oct | 54105670 |
9 | 23684171 |
10 | 11570104 |
11 | 6592877 |
12 | 3a5b7b4 |
13 | 2521420 |
14 | 1772720 |
15 | 10382a4 |
hex | b08bb8 |
11570104 has 64 divisors (see below), whose sum is σ = 27901440. Its totient is φ = 4371840.
The previous prime is 11570071. The next prime is 11570129. The reversal of 11570104 is 40107511.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 16399 + ... + 17089.
It is an arithmetic number, because the mean of its divisors is an integer number (435960).
Almost surely, 211570104 is an apocalyptic number.
11570104 is a gapful number since it is divisible by the number (14) 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 11570104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13950720).
11570104 is an abundant number, since it is smaller than the sum of its proper divisors (16331336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11570104 is a wasteful number, since it uses less digits than its factorization.
11570104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740 (or 736 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 19.
The square root of 11570104 is about 3401.4855578115. The cubic root of 11570104 is about 226.1756016382.
Adding to 11570104 its reverse (40107511), we get a palindrome (51677615).
The spelling of 11570104 in words is "eleven million, five hundred seventy thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •