Base | Representation |
---|---|
bin | 1110011110100… |
… | …10111011100011 |
3 | 22110112022100222 |
4 | 13033102323203 |
5 | 222042401321 |
6 | 20015033255 |
7 | 3003211151 |
oct | 717227343 |
9 | 273468328 |
10 | 121450211 |
11 | 62612383 |
12 | 3480b82b |
13 | 1c21403c |
14 | 121b63d1 |
15 | a9e03ab |
hex | 73d2ee3 |
121450211 has 2 divisors, whose sum is σ = 121450212. Its totient is φ = 121450210.
The previous prime is 121450187. The next prime is 121450229. The reversal of 121450211 is 112054121.
It is a strong prime.
It is an emirp because it is prime and its reverse (112054121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121450211 - 214 = 121433827 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121450211.
It is not a weakly prime, because it can be changed into another prime (121450271) 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 as a sum of consecutive naturals, namely, 60725105 + 60725106.
It is an arithmetic number, because the mean of its divisors is an integer number (60725106).
Almost surely, 2121450211 is an apocalyptic number.
121450211 is a deficient number, since it is larger than the sum of its proper divisors (1).
121450211 is an equidigital number, since it uses as much as digits as its factorization.
121450211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 121450211 is about 11020.4451362003. The cubic root of 121450211 is about 495.2214239115.
The spelling of 121450211 in words is "one hundred twenty-one million, four hundred fifty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •