Base | Representation |
---|---|
bin | 1100001111100011010… |
… | …1111110111010110001 |
3 | 202002220111021021221212 |
4 | 3003320311332322301 |
5 | 11421230313043441 |
6 | 240343101125505 |
7 | 21124153546544 |
oct | 3037065767261 |
9 | 662814237855 |
10 | 210333331121 |
11 | 81224755881 |
12 | 34920259895 |
13 | 16ab00a76a4 |
14 | a27461285b |
15 | 5710726eeb |
hex | 30f8d7eeb1 |
210333331121 has 2 divisors, whose sum is σ = 210333331122. Its totient is φ = 210333331120.
The previous prime is 210333331081. The next prime is 210333331133. The reversal of 210333331121 is 121133333012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 125270692096 + 85062639025 = 353936^2 + 291655^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210333331121 is a prime.
It is a super-2 number, since 2×2103333311212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (210333331721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105166665560 + 105166665561.
It is an arithmetic number, because the mean of its divisors is an integer number (105166665561).
Almost surely, 2210333331121 is an apocalyptic number.
It is an amenable number.
210333331121 is a deficient number, since it is larger than the sum of its proper divisors (1).
210333331121 is an equidigital number, since it uses as much as digits as its factorization.
210333331121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 210333331121 its reverse (121133333012), we get a palindrome (331466664133).
The spelling of 210333331121 in words is "two hundred ten billion, three hundred thirty-three million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •