Base | Representation |
---|---|
bin | 11101110100010111100110… |
… | …011110111010010000111111 |
3 | 122012100001200122212212212010 |
4 | 131310113212132322100333 |
5 | 114142113011421431143 |
6 | 1142525503415342303 |
7 | 36423463400525211 |
oct | 3564274636722077 |
9 | 565301618785763 |
10 | 131142103311423 |
11 | 388710654a7266 |
12 | 12860275081993 |
13 | 58238550bcb89 |
14 | 24554513025b1 |
15 | 10264914eea33 |
hex | 7745e67ba43f |
131142103311423 has 16 divisors (see below), whose sum is σ = 179821103230976. Its totient is φ = 84951878868000.
The previous prime is 131142103311389. The next prime is 131142103311449. The reversal of 131142103311423 is 324113301241131.
It is a happy number.
It is not a de Polignac number, because 131142103311423 - 234 = 131124923442239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131142103311463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 786508111 + ... + 786674832.
It is an arithmetic number, because the mean of its divisors is an integer number (11238818951936).
Almost surely, 2131142103311423 is an apocalyptic number.
131142103311423 is a deficient number, since it is larger than the sum of its proper divisors (48678999919553).
131142103311423 is a wasteful number, since it uses less digits than its factorization.
131142103311423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1573183734.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 131142103311423 its reverse (324113301241131), we get a palindrome (455255404552554).
The spelling of 131142103311423 in words is "one hundred thirty-one trillion, one hundred forty-two billion, one hundred three million, three hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •