Base | Representation |
---|---|
bin | 11101110111001000011101… |
… | …011001100000010001001011 |
3 | 122020000012212010000212002022 |
4 | 131313020131121200101023 |
5 | 114203220420304431443 |
6 | 1143153031145155055 |
7 | 36443265320131343 |
oct | 3567103531402113 |
9 | 566005763025068 |
10 | 131332003202123 |
11 | 38934653a97899 |
12 | 1289103218ba8b |
13 | 5838729a703c9 |
14 | 2460707c41d23 |
15 | 102b3a7ddde68 |
hex | 77721d66044b |
131332003202123 has 2 divisors, whose sum is σ = 131332003202124. Its totient is φ = 131332003202122.
The previous prime is 131332003202039. The next prime is 131332003202143. The reversal of 131332003202123 is 321202300233131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131332003202123 - 210 = 131332003201099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131332003202092 and 131332003202101.
It is not a weakly prime, because it can be changed into another prime (131332003202143) 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, 65666001601061 + 65666001601062.
It is an arithmetic number, because the mean of its divisors is an integer number (65666001601062).
Almost surely, 2131332003202123 is an apocalyptic number.
131332003202123 is a deficient number, since it is larger than the sum of its proper divisors (1).
131332003202123 is an equidigital number, since it uses as much as digits as its factorization.
131332003202123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 131332003202123 its reverse (321202300233131), we get a palindrome (452534303435254).
The spelling of 131332003202123 in words is "one hundred thirty-one trillion, three hundred thirty-two billion, three million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •