Base | Representation |
---|---|
bin | 11101110110110110110010… |
… | …000110101010000101110111 |
3 | 122012221101212100212101110221 |
4 | 131312312302012222011313 |
5 | 114202413032421332302 |
6 | 1143140211534355211 |
7 | 36442024062052531 |
oct | 3566666206520567 |
9 | 565841770771427 |
10 | 131313023230327 |
11 | 389275a4321094 |
12 | 1288941595bb07 |
13 | 58369c37c5b73 |
14 | 245d8271dc851 |
15 | 102ab469ad937 |
hex | 776db21aa177 |
131313023230327 has 2 divisors, whose sum is σ = 131313023230328. Its totient is φ = 131313023230326.
The previous prime is 131313023230321. The next prime is 131313023230357. The reversal of 131313023230327 is 723032320313131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131313023230327 - 219 = 131313022706039 is a prime.
It is a super-2 number, since 2×1313130232303272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131313023230292 and 131313023230301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131313023230321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65656511615163 + 65656511615164.
It is an arithmetic number, because the mean of its divisors is an integer number (65656511615164).
Almost surely, 2131313023230327 is an apocalyptic number.
131313023230327 is a deficient number, since it is larger than the sum of its proper divisors (1).
131313023230327 is an equidigital number, since it uses as much as digits as its factorization.
131313023230327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 34.
Adding to 131313023230327 its reverse (723032320313131), we get a palindrome (854345343543458).
The spelling of 131313023230327 in words is "one hundred thirty-one trillion, three hundred thirteen billion, twenty-three million, two hundred thirty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •