Base | Representation |
---|---|
bin | 1110011110111… |
… | …11011001110101 |
3 | 22110121220110012 |
4 | 13033133121311 |
5 | 222101020201 |
6 | 20020110005 |
7 | 3003513125 |
oct | 717373165 |
9 | 273556405 |
10 | 121501301 |
11 | 626477a9 |
12 | 34835305 |
13 | 1c23137c |
14 | 121cac85 |
15 | aa005bb |
hex | 73df675 |
121501301 has 2 divisors, whose sum is σ = 121501302. Its totient is φ = 121501300.
The previous prime is 121501297. The next prime is 121501337. The reversal of 121501301 is 103105121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92352100 + 29149201 = 9610^2 + 5399^2 .
It is a cyclic number.
It is not a de Polignac number, because 121501301 - 22 = 121501297 is a prime.
It is a super-2 number, since 2×1215013012 = 29525132289385202, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121501361) by changing a digit.
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 as a sum of consecutive naturals, namely, 60750650 + 60750651.
It is an arithmetic number, because the mean of its divisors is an integer number (60750651).
Almost surely, 2121501301 is an apocalyptic number.
It is an amenable number.
121501301 is a deficient number, since it is larger than the sum of its proper divisors (1).
121501301 is an equidigital number, since it uses as much as digits as its factorization.
121501301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 121501301 is about 11022.7628569248. The cubic root of 121501301 is about 495.2908551498.
Adding to 121501301 its reverse (103105121), we get a palindrome (224606422).
The spelling of 121501301 in words is "one hundred twenty-one million, five hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •