Base | Representation |
---|---|
bin | 1110011011100… |
… | …11111100000000 |
3 | 22102210112122012 |
4 | 13031303330000 |
5 | 221442423440 |
6 | 20002432052 |
7 | 3000000605 |
oct | 715637400 |
9 | 272715565 |
10 | 121061120 |
11 | 62377014 |
12 | 34662628 |
13 | 1c108bcb |
14 | 121146ac |
15 | a964e65 |
hex | 7373f00 |
121061120 has 72 divisors (see below), whose sum is σ = 291883200. Its totient is φ = 48107520.
The previous prime is 121061111. The next prime is 121061147. The reversal of 121061120 is 21160121.
It is a junction number, because it is equal to n+sod(n) for n = 121061095 and 121061104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 346706 + ... + 347054.
Almost surely, 2121061120 is an apocalyptic number.
121061120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121061120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145941600).
121061120 is an abundant number, since it is smaller than the sum of its proper divisors (170822080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121061120 is an equidigital number, since it uses as much as digits as its factorization.
121061120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641 (or 627 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 121061120 is about 11002.7778310752. Note that the first 3 decimals coincide. The cubic root of 121061120 is about 494.6920098836.
Subtracting from 121061120 its reverse (21160121), we obtain a palindrome (99900999).
The spelling of 121061120 in words is "one hundred twenty-one million, sixty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •