Base | Representation |
---|---|
bin | 101011011110… |
… | …101111101101 |
3 | 210110002021210 |
4 | 223132233231 |
5 | 10404220000 |
6 | 1044145033 |
7 | 165611454 |
oct | 53365755 |
9 | 23402253 |
10 | 11398125 |
11 | 6485642 |
12 | 3998179 |
13 | 249106b |
14 | 1729b9b |
15 | 1002350 |
hex | adebed |
11398125 has 20 divisors (see below), whose sum is σ = 18993920. Its totient is φ = 6078000.
The previous prime is 11398117. The next prime is 11398129. The reversal of 11398125 is 52189311.
It is not a de Polignac number, because 11398125 - 23 = 11398117 is a prime.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11398092 and 11398101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11398129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1165 + ... + 4914.
It is an arithmetic number, because the mean of its divisors is an integer number (949696).
Almost surely, 211398125 is an apocalyptic number.
11398125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11398125 is a deficient number, since it is larger than the sum of its proper divisors (7595795).
11398125 is an frugal number, since it uses more digits than its factorization.
11398125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6102 (or 6087 counting only the distinct ones).
The product of its digits is 2160, while the sum is 30.
The square root of 11398125 is about 3376.1109282724. The cubic root of 11398125 is about 225.0493718816.
The spelling of 11398125 in words is "eleven million, three hundred ninety-eight thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •