Base | Representation |
---|---|
bin | 11011100000111111001011… |
… | …101110001100101010001001 |
3 | 120212110211121012012110020122 |
4 | 123200333023232030222021 |
5 | 111330143410042400441 |
6 | 1105213041523033025 |
7 | 34326660512242544 |
oct | 3340771356145211 |
9 | 525424535173218 |
10 | 121014121450121 |
11 | 356168897aa639 |
12 | 116a542050b775 |
13 | 526a776218353 |
14 | 21c5186b6585b |
15 | deccc59e034b |
hex | 6e0fcbb8ca89 |
121014121450121 has 2 divisors, whose sum is σ = 121014121450122. Its totient is φ = 121014121450120.
The previous prime is 121014121450073. The next prime is 121014121450129. The reversal of 121014121450121 is 121054121410121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113997026409721 + 7017095040400 = 10676939^2 + 2648980^2 .
It is a cyclic number.
It is not a de Polignac number, because 121014121450121 - 210 = 121014121449097 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (121014121450129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60507060725060 + 60507060725061.
It is an arithmetic number, because the mean of its divisors is an integer number (60507060725061).
Almost surely, 2121014121450121 is an apocalyptic number.
It is an amenable number.
121014121450121 is a deficient number, since it is larger than the sum of its proper divisors (1).
121014121450121 is an equidigital number, since it uses as much as digits as its factorization.
121014121450121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 26.
Adding to 121014121450121 its reverse (121054121410121), we get a palindrome (242068242860242).
The spelling of 121014121450121 in words is "one hundred twenty-one trillion, fourteen billion, one hundred twenty-one million, four hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •