Base | Representation |
---|---|
bin | 10111011110001100100010… |
… | …110100101111100100010111 |
3 | 111112111200222210000011100212 |
4 | 113132030202310233210113 |
5 | 102012310243020223111 |
6 | 1003315133001200035 |
7 | 30513062454336125 |
oct | 2736144264574427 |
9 | 445450883004325 |
10 | 103230123211031 |
11 | 2a98a716392383 |
12 | b6b283349001b |
13 | 457a735a3972b |
14 | 1b6c516748915 |
15 | be03bbced98b |
hex | 5de322d2f917 |
103230123211031 has 2 divisors, whose sum is σ = 103230123211032. Its totient is φ = 103230123211030.
The previous prime is 103230123210961. The next prime is 103230123211057. The reversal of 103230123211031 is 130112321032301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103230123211031 is a prime.
It is a super-2 number, since 2×1032301232110312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103230123210988 and 103230123211006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103230123211091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51615061605515 + 51615061605516.
It is an arithmetic number, because the mean of its divisors is an integer number (51615061605516).
Almost surely, 2103230123211031 is an apocalyptic number.
103230123211031 is a deficient number, since it is larger than the sum of its proper divisors (1).
103230123211031 is an equidigital number, since it uses as much as digits as its factorization.
103230123211031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 103230123211031 its reverse (130112321032301), we get a palindrome (233342444243332).
The spelling of 103230123211031 in words is "one hundred three trillion, two hundred thirty billion, one hundred twenty-three million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •