Base | Representation |
---|---|
bin | 11011100011101100011001… |
… | …000010100010000111000111 |
3 | 120220010121122111211110201101 |
4 | 123203230121002202013013 |
5 | 111341220302132021411 |
6 | 1105434320332240531 |
7 | 34346263342560316 |
oct | 3343543102420707 |
9 | 526117574743641 |
10 | 121200102220231 |
11 | 35688747028931 |
12 | 11715485010147 |
13 | 5282174c54908 |
14 | 21d018ada627d |
15 | e02a5d2d38c1 |
hex | 6e3b190a21c7 |
121200102220231 has 2 divisors, whose sum is σ = 121200102220232. Its totient is φ = 121200102220230.
The previous prime is 121200102220187. The next prime is 121200102220247. The reversal of 121200102220231 is 132022201002121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121200102220231 - 27 = 121200102220103 is a prime.
It is a super-2 number, since 2×1212001022202312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121200102220199 and 121200102220208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121200102224231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60600051110115 + 60600051110116.
It is an arithmetic number, because the mean of its divisors is an integer number (60600051110116).
Almost surely, 2121200102220231 is an apocalyptic number.
121200102220231 is a deficient number, since it is larger than the sum of its proper divisors (1).
121200102220231 is an equidigital number, since it uses as much as digits as its factorization.
121200102220231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 121200102220231 its reverse (132022201002121), we get a palindrome (253222303222352).
The spelling of 121200102220231 in words is "one hundred twenty-one trillion, two hundred billion, one hundred two million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •