Base | Representation |
---|---|
bin | 10111011100110000100000… |
… | …101100010111011111100111 |
3 | 111112011020220211202010112221 |
4 | 113130300200230113133213 |
5 | 102004200402110304111 |
6 | 1003201511105453211 |
7 | 30502663556245522 |
oct | 2734604054273747 |
9 | 445136824663487 |
10 | 103131303213031 |
11 | 2a951816044245 |
12 | b697654941207 |
13 | 457131783bc32 |
14 | 1b678202cdbb9 |
15 | bdca3649e371 |
hex | 5dcc20b177e7 |
103131303213031 has 2 divisors, whose sum is σ = 103131303213032. Its totient is φ = 103131303213030.
The previous prime is 103131303213023. The next prime is 103131303213041. The reversal of 103131303213031 is 130312303131301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103131303213031 - 23 = 103131303213023 is a prime.
It is a super-2 number, since 2×1031313032130312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103131303212987 and 103131303213005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103131303213041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51565651606515 + 51565651606516.
It is an arithmetic number, because the mean of its divisors is an integer number (51565651606516).
Almost surely, 2103131303213031 is an apocalyptic number.
103131303213031 is a deficient number, since it is larger than the sum of its proper divisors (1).
103131303213031 is an equidigital number, since it uses as much as digits as its factorization.
103131303213031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 103131303213031 its reverse (130312303131301), we get a palindrome (233443606344332).
The spelling of 103131303213031 in words is "one hundred three trillion, one hundred thirty-one billion, three hundred three million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •