Base | Representation |
---|---|
bin | 101011100011… |
… | …100000101001 |
3 | 210111002001121 |
4 | 223203200221 |
5 | 10410331031 |
6 | 1044415241 |
7 | 166022404 |
oct | 53434051 |
9 | 23432047 |
10 | 11417641 |
11 | 6499274 |
12 | 39a7521 |
13 | 2499c01 |
14 | 1732d3b |
15 | 1008011 |
hex | ae3829 |
11417641 has 9 divisors (see below), whose sum is σ = 11907063. Its totient is φ = 10947960.
The previous prime is 11417611. The next prime is 11417701. The reversal of 11417641 is 14671411.
The square root of 11417641 is 3379.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 7958041 + 3459600 = 2821^2 + 1860^2 .
It is not a de Polignac number, because 11417641 - 27 = 11417513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11417611) 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 8 ways as a sum of consecutive naturals, for example, 104695 + ... + 104803.
It is an arithmetic number, because the mean of its divisors is an integer number (1323007).
Almost surely, 211417641 is an apocalyptic number.
11417641 is the 3379-th square number.
11417641 is the 1690-th centered octagonal number.
It is an amenable number.
11417641 is a deficient number, since it is larger than the sum of its proper divisors (489422).
11417641 is an frugal number, since it uses more digits than its factorization.
11417641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280 (or 140 counting only the distinct ones).
The product of its digits is 672, while the sum is 25.
The cubic root of 11417641 is about 225.1777426797.
Multiplying 11417641 by its sum of digits (25), we get a square (285441025 = 168952).
The spelling of 11417641 in words is "eleven million, four hundred seventeen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •