Base | Representation |
---|---|
bin | 1110011101011… |
… | …10010110101101 |
3 | 22110020200212022 |
4 | 13032232112231 |
5 | 222023103042 |
6 | 20011515525 |
7 | 3002015321 |
oct | 716562655 |
9 | 273220768 |
10 | 121300397 |
11 | 6251a869 |
12 | 34758ba5 |
13 | 1c190aaa |
14 | 12177981 |
15 | a9b0cd2 |
hex | 73ae5ad |
121300397 has 2 divisors, whose sum is σ = 121300398. Its totient is φ = 121300396.
The previous prime is 121300357. The next prime is 121300429. The reversal of 121300397 is 793003121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118679236 + 2621161 = 10894^2 + 1619^2 .
It is an emirp because it is prime and its reverse (793003121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121300397 - 28 = 121300141 is a prime.
It is a Chen prime.
It is equal to p6911450 and since 121300397 and 6911450 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121300327) 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, 60650198 + 60650199.
It is an arithmetic number, because the mean of its divisors is an integer number (60650199).
Almost surely, 2121300397 is an apocalyptic number.
It is an amenable number.
121300397 is a deficient number, since it is larger than the sum of its proper divisors (1).
121300397 is an equidigital number, since it uses as much as digits as its factorization.
121300397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
The square root of 121300397 is about 11013.6459449176. The cubic root of 121300397 is about 495.0177145652.
The spelling of 121300397 in words is "one hundred twenty-one million, three hundred thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •