Base | Representation |
---|---|
bin | 11101110111000110101100… |
… | …001001100100110101101011 |
3 | 122020000000221200211210201012 |
4 | 131313012230021210311223 |
5 | 114203203022404414011 |
6 | 1143152114433414135 |
7 | 36443200246316012 |
oct | 3567065411446553 |
9 | 566000850753635 |
10 | 131330103201131 |
11 | 38933869540a3a |
12 | 128907a1a0a34b |
13 | 58384b6239273 |
14 | 24605a7777a79 |
15 | 102b2e61d0a8b |
hex | 7771ac264d6b |
131330103201131 has 2 divisors, whose sum is σ = 131330103201132. Its totient is φ = 131330103201130.
The previous prime is 131330103201119. The next prime is 131330103201137. The reversal of 131330103201131 is 131102301033131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131330103201131 is a prime.
It is a super-2 number, since 2×1313301032011312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131330103201097 and 131330103201106.
It is not a weakly prime, because it can be changed into another prime (131330103201137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65665051600565 + 65665051600566.
It is an arithmetic number, because the mean of its divisors is an integer number (65665051600566).
Almost surely, 2131330103201131 is an apocalyptic number.
131330103201131 is a deficient number, since it is larger than the sum of its proper divisors (1).
131330103201131 is an equidigital number, since it uses as much as digits as its factorization.
131330103201131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 131330103201131 its reverse (131102301033131), we get a palindrome (262432404234262).
The spelling of 131330103201131 in words is "one hundred thirty-one trillion, three hundred thirty billion, one hundred three million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •