Base | Representation |
---|---|
bin | 11101110110101101100011… |
… | …010110101101000110110011 |
3 | 122012220110021122022220210222 |
4 | 131312231203112231012303 |
5 | 114202232233144233243 |
6 | 1143131452244443255 |
7 | 36441223343624600 |
oct | 3566554326550663 |
9 | 565813248286728 |
10 | 131303112102323 |
11 | 38923378797a07 |
12 | 1288750a6a952b |
13 | 5835aa4354095 |
14 | 245d166bb16a7 |
15 | 102a766808168 |
hex | 776b635ad1b3 |
131303112102323 has 12 divisors (see below), whose sum is σ = 152740614164112. Its totient is φ = 112545333618480.
The previous prime is 131303112102289. The next prime is 131303112102341. The reversal of 131303112102323 is 323201211303131.
It is not a de Polignac number, because 131303112102323 - 220 = 131303111053747 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131303112102292 and 131303112102301.
It is not an unprimeable number, because it can be changed into a prime (131303112102923) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32150333 + ... + 36003473.
It is an arithmetic number, because the mean of its divisors is an integer number (12728384513676).
Almost surely, 2131303112102323 is an apocalyptic number.
131303112102323 is a deficient number, since it is larger than the sum of its proper divisors (21437502061789).
131303112102323 is an equidigital number, since it uses as much as digits as its factorization.
131303112102323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4548602 (or 4548595 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 131303112102323 its reverse (323201211303131), we get a palindrome (454504323405454).
The spelling of 131303112102323 in words is "one hundred thirty-one trillion, three hundred three billion, one hundred twelve million, one hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •