Base | Representation |
---|---|
bin | 111101001001011100… |
… | …0100110101110110011 |
3 | 110112221110012101020021 |
4 | 1322102320212232303 |
5 | 4122412203043443 |
6 | 140154032224311 |
7 | 12326031620032 |
oct | 1722270465663 |
9 | 415843171207 |
10 | 131313331123 |
11 | 50764a52257 |
12 | 2154869b097 |
13 | c4c8cc9640 |
14 | 64d9a9a719 |
15 | 36382d89ed |
hex | 1e92e26bb3 |
131313331123 has 8 divisors (see below), whose sum is σ = 141497909168. Its totient is φ = 121140689184.
The previous prime is 131313331109. The next prime is 131313331139. The reversal of 131313331123 is 321133313131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131313331123 is a prime.
It is a super-2 number, since 2×1313133311232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131313331153) 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, 2961165 + ... + 3005182.
It is an arithmetic number, because the mean of its divisors is an integer number (17687238646).
Almost surely, 2131313331123 is an apocalyptic number.
131313331123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131313331123 is a deficient number, since it is larger than the sum of its proper divisors (10184578045).
131313331123 is a wasteful number, since it uses less digits than its factorization.
131313331123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5968053.
The product of its digits is 1458, while the sum is 25.
Adding to 131313331123 its reverse (321133313131), we get a palindrome (452446644254).
The spelling of 131313331123 in words is "one hundred thirty-one billion, three hundred thirteen million, three hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •