Base | Representation |
---|---|
bin | 11011100010101100001111… |
… | …111111101110000011001111 |
3 | 120212220000212202111112201011 |
4 | 123202230033333232003033 |
5 | 111334103230114323043 |
6 | 1105342530323230051 |
7 | 34341304553135032 |
oct | 3342541777560317 |
9 | 525800782445634 |
10 | 121131231011023 |
11 | 35661515026012 |
12 | 11704064218327 |
13 | 527881a62b70c |
14 | 21caad6265019 |
15 | e00d7bd4459d |
hex | 6e2b0ffee0cf |
121131231011023 has 2 divisors, whose sum is σ = 121131231011024. Its totient is φ = 121131231011022.
The previous prime is 121131231010973. The next prime is 121131231011033. The reversal of 121131231011023 is 320110132131121.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121131231011023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121131231010985 and 121131231011003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121131231011033) 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, 60565615505511 + 60565615505512.
It is an arithmetic number, because the mean of its divisors is an integer number (60565615505512).
Almost surely, 2121131231011023 is an apocalyptic number.
121131231011023 is a deficient number, since it is larger than the sum of its proper divisors (1).
121131231011023 is an equidigital number, since it uses as much as digits as its factorization.
121131231011023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 121131231011023 its reverse (320110132131121), we get a palindrome (441241363142144).
The spelling of 121131231011023 in words is "one hundred twenty-one trillion, one hundred thirty-one billion, two hundred thirty-one million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •