Base | Representation |
---|---|
bin | 101100011010… |
… | …000010110101 |
3 | 210220102110122 |
4 | 230122002311 |
5 | 10440003023 |
6 | 1053301325 |
7 | 200642546 |
oct | 54320265 |
9 | 23812418 |
10 | 11641013 |
11 | 663107a |
12 | 3a94845 |
13 | 2547797 |
14 | 17904cd |
15 | 104e2c8 |
hex | b1a0b5 |
11641013 has 4 divisors (see below), whose sum is σ = 12147168. Its totient is φ = 11134860.
The previous prime is 11641009. The next prime is 11641033. The reversal of 11641013 is 31014611.
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 cyclic number.
It is not a de Polignac number, because 11641013 - 22 = 11641009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11640982 and 11641000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11641033) 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, 253043 + ... + 253088.
It is an arithmetic number, because the mean of its divisors is an integer number (3036792).
Almost surely, 211641013 is an apocalyptic number.
It is an amenable number.
11641013 is a deficient number, since it is larger than the sum of its proper divisors (506155).
11641013 is an equidigital number, since it uses as much as digits as its factorization.
11641013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506154.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 11641013 is about 3411.8928763957. The cubic root of 11641013 is about 226.6367105260.
Adding to 11641013 its reverse (31014611), we get a palindrome (42655624).
The spelling of 11641013 in words is "eleven million, six hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •