Base | Representation |
---|---|
bin | 111101000000101101… |
… | …0000100000010010111 |
3 | 110112012000110022020121 |
4 | 1322001122010002113 |
5 | 4121312122041043 |
6 | 140104555412411 |
7 | 12315541401613 |
oct | 1720132040227 |
9 | 415160408217 |
10 | 131020112023 |
11 | 5062448a419 |
12 | 21486454107 |
13 | c480334108 |
14 | 64acb70343 |
15 | 361c6b8ded |
hex | 1e81684097 |
131020112023 has 4 divisors (see below), whose sum is σ = 131804663760. Its totient is φ = 130235560288.
The previous prime is 131020112009. The next prime is 131020112051. The reversal of 131020112023 is 320211020131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320211020131 = 24989 ⋅12814079.
It is a cyclic number.
It is not a de Polignac number, because 131020112023 - 213 = 131020103831 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131020111988 and 131020112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131020112063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 392275618 + ... + 392275951.
It is an arithmetic number, because the mean of its divisors is an integer number (32951165940).
Almost surely, 2131020112023 is an apocalyptic number.
131020112023 is a deficient number, since it is larger than the sum of its proper divisors (784551737).
131020112023 is an equidigital number, since it uses as much as digits as its factorization.
131020112023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784551736.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 131020112023 its reverse (320211020131), we get a palindrome (451231132154).
The spelling of 131020112023 in words is "one hundred thirty-one billion, twenty million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •