Base | Representation |
---|---|
bin | 11011100010010001111101… |
… | …011110011110111100111001 |
3 | 120212210100000111120002012101 |
4 | 123202101331132132330321 |
5 | 111333122422233133423 |
6 | 1105321541311343401 |
7 | 34336255211156251 |
oct | 3342217536367471 |
9 | 525710014502171 |
10 | 121103003021113 |
11 | 3565054a069433 |
12 | 116ba6a6821b61 |
13 | 5275c6c4065c9 |
14 | 21c95b92c8961 |
15 | e00278a957ad |
hex | 6e247d79ef39 |
121103003021113 has 2 divisors, whose sum is σ = 121103003021114. Its totient is φ = 121103003021112.
The previous prime is 121103003021069. The next prime is 121103003021129. The reversal of 121103003021113 is 311120300301121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96584630751504 + 24518372269609 = 9827748^2 + 4951603^2 .
It is a cyclic number.
It is not a de Polignac number, because 121103003021113 - 229 = 121102466150201 is a prime.
It is not a weakly prime, because it can be changed into another prime (121103003027113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60551501510556 + 60551501510557.
It is an arithmetic number, because the mean of its divisors is an integer number (60551501510557).
Almost surely, 2121103003021113 is an apocalyptic number.
It is an amenable number.
121103003021113 is a deficient number, since it is larger than the sum of its proper divisors (1).
121103003021113 is an equidigital number, since it uses as much as digits as its factorization.
121103003021113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 121103003021113 its reverse (311120300301121), we get a palindrome (432223303322234).
The spelling of 121103003021113 in words is "one hundred twenty-one trillion, one hundred three billion, three million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •