Base | Representation |
---|---|
bin | 11011100111000011111110… |
… | …111000001101010100010101 |
3 | 120220221202011101211100012221 |
4 | 123213003332320031110111 |
5 | 111404013344413234424 |
6 | 1110132523015542341 |
7 | 34402100016406303 |
oct | 3347037670152425 |
9 | 526852141740187 |
10 | 121431591539989 |
11 | 35767937789035 |
12 | 1175230a38a9b1 |
13 | 529ac4705ba73 |
14 | 21db46b215273 |
15 | e08aaaebb9e4 |
hex | 6e70fee0d515 |
121431591539989 has 2 divisors, whose sum is σ = 121431591539990. Its totient is φ = 121431591539988.
The previous prime is 121431591539981. The next prime is 121431591540023. The reversal of 121431591539989 is 989935195134121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89871442803025 + 31560148736964 = 9480055^2 + 5617842^2 .
It is a cyclic number.
It is not a de Polignac number, because 121431591539989 - 23 = 121431591539981 is a prime.
It is a super-2 number, since 2×1214315915399892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121431591539981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60715795769994 + 60715795769995.
It is an arithmetic number, because the mean of its divisors is an integer number (60715795769995).
Almost surely, 2121431591539989 is an apocalyptic number.
It is an amenable number.
121431591539989 is a deficient number, since it is larger than the sum of its proper divisors (1).
121431591539989 is an equidigital number, since it uses as much as digits as its factorization.
121431591539989 is an evil number, because the sum of its binary digits is even.
The product of its digits is 94478400, while the sum is 70.
The spelling of 121431591539989 in words is "one hundred twenty-one trillion, four hundred thirty-one billion, five hundred ninety-one million, five hundred thirty-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •