Base | Representation |
---|---|
bin | 101011101100… |
… | …000011110101 |
3 | 210112212002122 |
4 | 223230003311 |
5 | 10412441121 |
6 | 1045245325 |
7 | 166226453 |
oct | 53540365 |
9 | 23485078 |
10 | 11452661 |
11 | 6512610 |
12 | 3a03845 |
13 | 24acb2c |
14 | 17419d3 |
15 | 10135ab |
hex | aec0f5 |
11452661 has 4 divisors (see below), whose sum is σ = 12493824. Its totient is φ = 10411500.
The previous prime is 11452621. The next prime is 11452669. The reversal of 11452661 is 16625411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a de Polignac number, because none of the positive numbers 2k-11452661 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11452661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11452669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 520565 + ... + 520586.
It is an arithmetic number, because the mean of its divisors is an integer number (3123456).
Almost surely, 211452661 is an apocalyptic number.
11452661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11452661 is a deficient number, since it is larger than the sum of its proper divisors (1041163).
11452661 is a wasteful number, since it uses less digits than its factorization.
11452661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041162.
The product of its digits is 1440, while the sum is 26.
The square root of 11452661 is about 3384.1780390517. The cubic root of 11452661 is about 225.4077281889.
The spelling of 11452661 in words is "eleven million, four hundred fifty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •