Base | Representation |
---|---|
bin | 11011100011101100100000… |
… | …110110010001100000111001 |
3 | 120220010121222122100011110001 |
4 | 123203230200312101200321 |
5 | 111341221034201133444 |
6 | 1105434341332153001 |
7 | 34346266523232244 |
oct | 3343544066214071 |
9 | 526117878304401 |
10 | 121200233224249 |
11 | 35688803a76113 |
12 | 11715500a68761 |
13 | 528219613239a |
14 | 21d01a054825b |
15 | e02a69a5e8d4 |
hex | 6e3b20d91839 |
121200233224249 has 2 divisors, whose sum is σ = 121200233224250. Its totient is φ = 121200233224248.
The previous prime is 121200233224229. The next prime is 121200233224253. The reversal of 121200233224249 is 942422332002121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121175117313849 + 25115910400 = 11007957^2 + 158480^2 .
It is a cyclic number.
It is not a de Polignac number, because 121200233224249 - 221 = 121200231127097 is a prime.
It is a super-3 number, since 3×1212002332242493 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (121200233224229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60600116612124 + 60600116612125.
It is an arithmetic number, because the mean of its divisors is an integer number (60600116612125).
Almost surely, 2121200233224249 is an apocalyptic number.
It is an amenable number.
121200233224249 is a deficient number, since it is larger than the sum of its proper divisors (1).
121200233224249 is an equidigital number, since it uses as much as digits as its factorization.
121200233224249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 121200233224249 in words is "one hundred twenty-one trillion, two hundred billion, two hundred thirty-three million, two hundred twenty-four thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •