Base | Representation |
---|---|
bin | 101011010101… |
… | …110101111111 |
3 | 210101020021100 |
4 | 223111311333 |
5 | 10402033123 |
6 | 1043304143 |
7 | 165400245 |
oct | 53256577 |
9 | 23336240 |
10 | 11361663 |
11 | 6460205 |
12 | 397b053 |
13 | 247a5a1 |
14 | 171a795 |
15 | ee6643 |
hex | ad5d7f |
11361663 has 12 divisors (see below), whose sum is σ = 16721640. Its totient is φ = 7431216.
The previous prime is 11361653. The next prime is 11361683. The reversal of 11361663 is 36616311.
It is a happy number.
It is not a de Polignac number, because 11361663 - 26 = 11361599 is a prime.
It is a super-2 number, since 2×113616632 = 258174772251138, which contains 22 as substring.
It is a nialpdrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11361613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11433 + ... + 12386.
It is an arithmetic number, because the mean of its divisors is an integer number (1393470).
Almost surely, 211361663 is an apocalyptic number.
11361663 is a deficient number, since it is larger than the sum of its proper divisors (5359977).
11361663 is a wasteful number, since it uses less digits than its factorization.
11361663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23878 (or 23875 counting only the distinct ones).
The product of its digits is 1944, while the sum is 27.
The square root of 11361663 is about 3370.7066024797. The cubic root of 11361663 is about 224.8091418524.
Adding to 11361663 its reverse (36616311), we get a palindrome (47977974).
It can be divided in two parts, 113 and 61663, that added together give a triangular number (61776 = T351).
The spelling of 11361663 in words is "eleven million, three hundred sixty-one thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •