Base | Representation |
---|---|
bin | 1110011111110… |
… | …00110111100110 |
3 | 22110211012112100 |
4 | 13033320313212 |
5 | 222112334411 |
6 | 20022232530 |
7 | 3004426203 |
oct | 717706746 |
9 | 273735470 |
10 | 121605606 |
11 | 62709101 |
12 | 34885746 |
13 | 1c2699a5 |
14 | 12216caa |
15 | aa21456 |
hex | 73f8de6 |
121605606 has 48 divisors (see below), whose sum is σ = 272557584. Its totient is φ = 39154752.
The previous prime is 121605593. The next prime is 121605637. The reversal of 121605606 is 606506121.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 121605606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 103981 + ... + 105143.
It is an arithmetic number, because the mean of its divisors is an integer number (5678283).
Almost surely, 2121605606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121605606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136278792).
121605606 is an abundant number, since it is smaller than the sum of its proper divisors (150951978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121605606 is a wasteful number, since it uses less digits than its factorization.
121605606 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1365 (or 1362 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 121605606 is about 11027.4931874837. The cubic root of 121605606 is about 495.4325450908.
It can be divided in two parts, 12160 and 5606, that added together give a triangular number (17766 = T188).
The spelling of 121605606 in words is "one hundred twenty-one million, six hundred five thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •