Base | Representation |
---|---|
bin | 10001101000110010101… |
… | …000010011001100000111 |
3 | 11021212110110122201112212 |
4 | 101220302220103030013 |
5 | 124324214212441011 |
6 | 2324444325334035 |
7 | 153365144511053 |
oct | 21506250231407 |
9 | 4255413581485 |
10 | 1212030202631 |
11 | 4280234a7416 |
12 | 176a9656731b |
13 | 8a3a8a957c1 |
14 | 4293c168c63 |
15 | 217dae2508b |
hex | 11a32a13307 |
1212030202631 has 2 divisors, whose sum is σ = 1212030202632. Its totient is φ = 1212030202630.
The previous prime is 1212030202543. The next prime is 1212030202667. The reversal of 1212030202631 is 1362020302121.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212030202631 is a prime.
It is a super-2 number, since 2×12120302026312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212030202597 and 1212030202606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212030202931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606015101315 + 606015101316.
It is an arithmetic number, because the mean of its divisors is an integer number (606015101316).
Almost surely, 21212030202631 is an apocalyptic number.
1212030202631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212030202631 is an equidigital number, since it uses as much as digits as its factorization.
1212030202631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1212030202631 its reverse (1362020302121), we get a palindrome (2574050504752).
The spelling of 1212030202631 in words is "one trillion, two hundred twelve billion, thirty million, two hundred two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •