Base | Representation |
---|---|
bin | 101100011110… |
… | …101101011001 |
3 | 210221101200100 |
4 | 230132231121 |
5 | 10441110441 |
6 | 1053530013 |
7 | 201052344 |
oct | 54365531 |
9 | 23841610 |
10 | 11660121 |
11 | 6644470 |
12 | 3aa3909 |
13 | 25533a5 |
14 | 179745b |
15 | 1054cb6 |
hex | b1eb59 |
11660121 has 12 divisors (see below), whose sum is σ = 18373680. Its totient is φ = 7066680.
The previous prime is 11660119. The next prime is 11660141. The reversal of 11660121 is 12106611.
11660121 is a `hidden beast` number, since 1 + 1 + 660 + 1 + 2 + 1 = 666.
It is not a de Polignac number, because 11660121 - 21 = 11660119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11660094 and 11660103.
It is not an unprimeable number, because it can be changed into a prime (11660101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 58791 + ... + 58988.
It is an arithmetic number, because the mean of its divisors is an integer number (1531140).
Almost surely, 211660121 is an apocalyptic number.
11660121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11660121 is a deficient number, since it is larger than the sum of its proper divisors (6713559).
11660121 is a wasteful number, since it uses less digits than its factorization.
11660121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117796 (or 117793 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 11660121 is about 3414.6919333960. The cubic root of 11660121 is about 226.7606461024.
Adding to 11660121 its reverse (12106611), we get a palindrome (23766732).
It can be divided in two parts, 11660 and 121, that added together give a triangular number (11781 = T153).
The spelling of 11660121 in words is "eleven million, six hundred sixty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •