Base | Representation |
---|---|
bin | 11011100100001001001010… |
… | …111000110011010101101111 |
3 | 120220020120102001200000211212 |
4 | 123210021022320303111233 |
5 | 111342222043321114411 |
6 | 1105500430513505035 |
7 | 34351436163456425 |
oct | 3344111270632557 |
9 | 526216361600755 |
10 | 121231003301231 |
11 | 3569a8639723aa |
12 | 1171b46987217b |
13 | 528505ac01425 |
14 | 21d187cd6d115 |
15 | e0376b09e68b |
hex | 6e424ae3356f |
121231003301231 has 2 divisors, whose sum is σ = 121231003301232. Its totient is φ = 121231003301230.
The previous prime is 121231003301209. The next prime is 121231003301251. The reversal of 121231003301231 is 132103300132121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121231003301231 - 210 = 121231003300207 is a prime.
It is a super-2 number, since 2×1212310033012312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121231003301197 and 121231003301206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121231003301251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60615501650615 + 60615501650616.
It is an arithmetic number, because the mean of its divisors is an integer number (60615501650616).
Almost surely, 2121231003301231 is an apocalyptic number.
121231003301231 is a deficient number, since it is larger than the sum of its proper divisors (1).
121231003301231 is an equidigital number, since it uses as much as digits as its factorization.
121231003301231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 121231003301231 its reverse (132103300132121), we get a palindrome (253334303433352).
The spelling of 121231003301231 in words is "one hundred twenty-one trillion, two hundred thirty-one billion, three million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •