Base | Representation |
---|---|
bin | 1110011110111… |
… | …11010111000001 |
3 | 22110121220012112 |
4 | 13033133113001 |
5 | 222101013441 |
6 | 20020105105 |
7 | 3003512450 |
oct | 717372701 |
9 | 273556175 |
10 | 121501121 |
11 | 62647655 |
12 | 34835195 |
13 | 1c231271 |
14 | 121cab97 |
15 | aa004eb |
hex | 73df5c1 |
121501121 has 8 divisors (see below), whose sum is σ = 143337984. Its totient is φ = 100784160.
The previous prime is 121501117. The next prime is 121501139. The reversal of 121501121 is 121105121.
121501121 = 642 + 652 + ... + 7142.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121501121 - 22 = 121501117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121501096 and 121501105.
It is not an unprimeable number, because it can be changed into a prime (121501141) 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 7 ways as a sum of consecutive naturals, for example, 279740 + ... + 280173.
It is an arithmetic number, because the mean of its divisors is an integer number (17917248).
Almost surely, 2121501121 is an apocalyptic number.
It is an amenable number.
121501121 is a deficient number, since it is larger than the sum of its proper divisors (21836863).
121501121 is an equidigital number, since it uses as much as digits as its factorization.
121501121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 559951.
The product of its (nonzero) digits is 20, while the sum is 14.
The square root of 121501121 is about 11022.7546919996. The cubic root of 121501121 is about 495.2906105643.
Adding to 121501121 its reverse (121105121), we get a palindrome (242606242).
The spelling of 121501121 in words is "one hundred twenty-one million, five hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •