Base | Representation |
---|---|
bin | 11011100010011001100111… |
… | …010111011001100101111101 |
3 | 120212211010020022000110122201 |
4 | 123202121213113121211331 |
5 | 111333241240312444442 |
6 | 1105325421032511501 |
7 | 34336665661300645 |
oct | 3342314727314575 |
9 | 525733208013581 |
10 | 121111221999997 |
11 | 35653a87501969 |
12 | 117001bb24b591 |
13 | 527697c11a418 |
14 | 21c9b58ab5525 |
15 | e005aa3e87b7 |
hex | 6e26675d997d |
121111221999997 has 2 divisors, whose sum is σ = 121111221999998. Its totient is φ = 121111221999996.
The previous prime is 121111221999979. The next prime is 121111222000003. The reversal of 121111221999997 is 799999122111121.
Together with previous prime (121111221999979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91013336288281 + 30097885711716 = 9540091^2 + 5486154^2 .
It is a cyclic number.
It is not a de Polignac number, because 121111221999997 - 231 = 121109074516349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121111221999917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555610999998 + 60555610999999.
It is an arithmetic number, because the mean of its divisors is an integer number (60555610999999).
Almost surely, 2121111221999997 is an apocalyptic number.
It is an amenable number.
121111221999997 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111221999997 is an equidigital number, since it uses as much as digits as its factorization.
121111221999997 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3306744, while the sum is 64.
The spelling of 121111221999997 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred twenty-one million, nine hundred ninety-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •