Base | Representation |
---|---|
bin | 111101000001010111… |
… | …0011100001011101111 |
3 | 110112020120002001210211 |
4 | 1322002232130023233 |
5 | 4121333302343043 |
6 | 140111105443251 |
7 | 12316230404524 |
oct | 1720256341357 |
9 | 415216061724 |
10 | 131042231023 |
11 | 50635a17790 |
12 | 21491940527 |
13 | c484aa9b92 |
14 | 64b1a8b14b |
15 | 361e5d7a9d |
hex | 1e82b9c2ef |
131042231023 has 8 divisors (see below), whose sum is σ = 142957941120. Its totient is φ = 119126984280.
The previous prime is 131042231011. The next prime is 131042231039. The reversal of 131042231023 is 320132240131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131042231023 - 29 = 131042230511 is a prime.
It is a super-2 number, since 2×1310422310232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131042230985 and 131042231003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131042231053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 770208 + ... + 924826.
It is an arithmetic number, because the mean of its divisors is an integer number (17869742640).
Almost surely, 2131042231023 is an apocalyptic number.
131042231023 is a deficient number, since it is larger than the sum of its proper divisors (11915710097).
131042231023 is a wasteful number, since it uses less digits than its factorization.
131042231023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231677.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 131042231023 its reverse (320132240131), we get a palindrome (451174471154).
The spelling of 131042231023 in words is "one hundred thirty-one billion, forty-two million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •