Base | Representation |
---|---|
bin | 111101001010000001… |
… | …0111101100000111101 |
3 | 110112222210212200012101 |
4 | 1322110002331200331 |
5 | 4122432200314401 |
6 | 140200010105101 |
7 | 12326356401664 |
oct | 1722402754075 |
9 | 415883780171 |
10 | 131332823101 |
11 | 50774a55927 |
12 | 2155311b191 |
13 | c50006275c |
14 | 64dc4d1ddb |
15 | 3639d89101 |
hex | 1e940bd83d |
131332823101 has 2 divisors, whose sum is σ = 131332823102. Its totient is φ = 131332823100.
The previous prime is 131332823099. The next prime is 131332823113. The reversal of 131332823101 is 101328233131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122238339876 + 9094483225 = 349626^2 + 95365^2 .
It is a cyclic number.
It is not a de Polignac number, because 131332823101 - 21 = 131332823099 is a prime.
Together with 131332823099, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 131332823101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131332823201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65666411550 + 65666411551.
It is an arithmetic number, because the mean of its divisors is an integer number (65666411551).
Almost surely, 2131332823101 is an apocalyptic number.
It is an amenable number.
131332823101 is a deficient number, since it is larger than the sum of its proper divisors (1).
131332823101 is an equidigital number, since it uses as much as digits as its factorization.
131332823101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 131332823101 in words is "one hundred thirty-one billion, three hundred thirty-two million, eight hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •