Base | Representation |
---|---|
bin | 101011100100… |
… | …000111001001 |
3 | 210111012102212 |
4 | 223210013021 |
5 | 10410420410 |
6 | 1044434505 |
7 | 166032524 |
oct | 53440711 |
9 | 23435385 |
10 | 11420105 |
11 | 64a0104 |
12 | 39a8a35 |
13 | 249b078 |
14 | 1733bbb |
15 | 1008b05 |
hex | ae41c9 |
11420105 has 8 divisors (see below), whose sum is σ = 13797000. Its totient is φ = 9074176.
The previous prime is 11420089. The next prime is 11420111. The reversal of 11420105 is 50102411.
It can be written as a sum of positive squares in 4 ways, for example, as 204304 + 11215801 = 452^2 + 3349^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11420105 - 24 = 11420089 is a prime.
It is a super-2 number, since 2×114201052 = 260837596422050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11420105.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 6920 + ... + 8409.
It is an arithmetic number, because the mean of its divisors is an integer number (1724625).
Almost surely, 211420105 is an apocalyptic number.
It is an amenable number.
11420105 is a deficient number, since it is larger than the sum of its proper divisors (2376895).
11420105 is a wasteful number, since it uses less digits than its factorization.
11420105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15483.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 11420105 is about 3379.3645852438. The cubic root of 11420105 is about 225.1939397806.
Adding to 11420105 its reverse (50102411), we get a palindrome (61522516).
The spelling of 11420105 in words is "eleven million, four hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •