Base | Representation |
---|---|
bin | 110100100001100001011001… |
… | …010110011110101010000111 |
3 | 1010021220120120221221121122201 |
4 | 310201201121112132222013 |
5 | 220234214114122104111 |
6 | 2135144510225135331 |
7 | 66441226255314316 |
oct | 6441413126365207 |
9 | 1107816527847581 |
10 | 231002020113031 |
11 | 676714521640a2 |
12 | 21aa98a518a547 |
13 | 9bb85213639cb |
14 | 41087b382a27d |
15 | 1ba8d5cb166c1 |
hex | d2185959ea87 |
231002020113031 has 2 divisors, whose sum is σ = 231002020113032. Its totient is φ = 231002020113030.
The previous prime is 231002020113017. The next prime is 231002020113149. The reversal of 231002020113031 is 130311020200132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 231002020113031 - 215 = 231002020080263 is a prime.
It is a super-2 number, since 2×2310020201130312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231002020113731) 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, 115501010056515 + 115501010056516.
It is an arithmetic number, because the mean of its divisors is an integer number (115501010056516).
Almost surely, 2231002020113031 is an apocalyptic number.
231002020113031 is a deficient number, since it is larger than the sum of its proper divisors (1).
231002020113031 is an equidigital number, since it uses as much as digits as its factorization.
231002020113031 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 231002020113031 its reverse (130311020200132), we get a palindrome (361313040313163).
The spelling of 231002020113031 in words is "two hundred thirty-one trillion, two billion, twenty million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.080 sec. • engine limits •