Base | Representation |
---|---|
bin | 10001100111001100110… |
… | …000010010010110101011 |
3 | 11021201001100112021012201 |
4 | 101213030300102112223 |
5 | 124312214140122311 |
6 | 2324002551521031 |
7 | 153304611633223 |
oct | 21471460222653 |
9 | 4251040467181 |
10 | 1210321020331 |
11 | 427326732465 |
12 | 17669a089177 |
13 | 8a195952927 |
14 | 42819173083 |
15 | 2173ad5a9c1 |
hex | 119ccc125ab |
1210321020331 has 2 divisors, whose sum is σ = 1210321020332. Its totient is φ = 1210321020330.
The previous prime is 1210321020317. The next prime is 1210321020343. The reversal of 1210321020331 is 1330201230121.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1210321020331 is a prime.
It is a super-2 number, since 2×12103210203312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210321020299 and 1210321020308.
It is not a weakly prime, because it can be changed into another prime (1210321020131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605160510165 + 605160510166.
It is an arithmetic number, because the mean of its divisors is an integer number (605160510166).
Almost surely, 21210321020331 is an apocalyptic number.
1210321020331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210321020331 is an equidigital number, since it uses as much as digits as its factorization.
1210321020331 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 19.
Adding to 1210321020331 its reverse (1330201230121), we get a palindrome (2540522250452).
The spelling of 1210321020331 in words is "one trillion, two hundred ten billion, three hundred twenty-one million, twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •