Base | Representation |
---|---|
bin | 1101011101010111101… |
… | …0011011110110011001 |
3 | 211002211021020022222011 |
4 | 3113111322123312121 |
5 | 12242020331211441 |
6 | 254115540425521 |
7 | 22463620460161 |
oct | 3272572336631 |
9 | 732737208864 |
10 | 231222132121 |
11 | 8a073958182 |
12 | 3898b9a82a1 |
13 | 18a5b957476 |
14 | b29697b5a1 |
15 | 603450b581 |
hex | 35d5e9bd99 |
231222132121 has 2 divisors, whose sum is σ = 231222132122. Its totient is φ = 231222132120.
The previous prime is 231222132073. The next prime is 231222132131. The reversal of 231222132121 is 121231222132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 205281486400 + 25940645721 = 453080^2 + 161061^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231222132121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 231222132092 and 231222132101.
It is not a weakly prime, because it can be changed into another prime (231222132131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115611066060 + 115611066061.
It is an arithmetic number, because the mean of its divisors is an integer number (115611066061).
Almost surely, 2231222132121 is an apocalyptic number.
It is an amenable number.
231222132121 is a deficient number, since it is larger than the sum of its proper divisors (1).
231222132121 is an equidigital number, since it uses as much as digits as its factorization.
231222132121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 576, while the sum is 22.
Adding to 231222132121 its reverse (121231222132), we get a palindrome (352453354253).
It can be divided in two parts, 231222132 and 121, that multiplied together give a palindrome (27977877972).
The spelling of 231222132121 in words is "two hundred thirty-one billion, two hundred twenty-two million, one hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •