Base | Representation |
---|---|
bin | 1110011110110… |
… | …11101110111010 |
3 | 22110121010211100 |
4 | 13033123232322 |
5 | 222100030031 |
6 | 20015512230 |
7 | 3003421236 |
oct | 717335672 |
9 | 273533740 |
10 | 121486266 |
11 | 62637480 |
12 | 34828676 |
13 | 1c227585 |
14 | 121c55c6 |
15 | a9eade6 |
hex | 73dbbba |
121486266 has 96 divisors (see below), whose sum is σ = 309703680. Its totient is φ = 34020000.
The previous prime is 121486243. The next prime is 121486271. The reversal of 121486266 is 662684121.
121486266 is a `hidden beast` number, since 1 + 21 + 4 + 8 + 626 + 6 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 121486266.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 161391 + ... + 162141.
It is an arithmetic number, because the mean of its divisors is an integer number (3226080).
Almost surely, 2121486266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121486266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154851840).
121486266 is an abundant number, since it is smaller than the sum of its proper divisors (188217414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121486266 is a wasteful number, since it uses less digits than its factorization.
121486266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832 (or 829 counting only the distinct ones).
The product of its digits is 27648, while the sum is 36.
The square root of 121486266 is about 11022.0808380269. The cubic root of 121486266 is about 495.2704246273.
The spelling of 121486266 in words is "one hundred twenty-one million, four hundred eighty-six thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •