Base | Representation |
---|---|
bin | 101011101100… |
… | …000001001101 |
3 | 210112211212102 |
4 | 223230001031 |
5 | 10412434433 |
6 | 1045244445 |
7 | 166226123 |
oct | 53540115 |
9 | 23484772 |
10 | 11452493 |
11 | 6512478 |
12 | 3a03725 |
13 | 24aca30 |
14 | 1741913 |
15 | 10134e8 |
hex | aec04d |
11452493 has 4 divisors (see below), whose sum is σ = 12333468. Its totient is φ = 10571520.
The previous prime is 11452481. The next prime is 11452501. The reversal of 11452493 is 39425411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3232804 + 8219689 = 1798^2 + 2867^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11452493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11452403) 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 3 ways as a sum of consecutive naturals, for example, 440468 + ... + 440493.
It is an arithmetic number, because the mean of its divisors is an integer number (3083367).
Almost surely, 211452493 is an apocalyptic number.
11452493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11452493 is a deficient number, since it is larger than the sum of its proper divisors (880975).
11452493 is an equidigital number, since it uses as much as digits as its factorization.
11452493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880974.
The product of its digits is 4320, while the sum is 29.
The square root of 11452493 is about 3384.1532175716. The cubic root of 11452493 is about 225.4066260088.
The spelling of 11452493 in words is "eleven million, four hundred fifty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •