Base | Representation |
---|---|
bin | 111001010101100110… |
… | …0000001110000010111 |
3 | 102202211012222001122221 |
4 | 1302223030001300113 |
5 | 4004133033004033 |
6 | 132322103403211 |
7 | 11616206300533 |
oct | 1625314016027 |
9 | 382735861587 |
10 | 123131141143 |
11 | 4824635687a |
12 | 1ba44453507 |
13 | b7c3ac68ca |
14 | 5d61128bc3 |
15 | 3309d0112d |
hex | 1cab301c17 |
123131141143 has 8 divisors (see below), whose sum is σ = 123495613056. Its totient is φ = 122766758400.
The previous prime is 123131141137. The next prime is 123131141183. The reversal of 123131141143 is 341141131321.
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 123131141143 - 213 = 123131132951 is a prime.
It is a super-2 number, since 2×1231311411432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123131141113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3608683 + ... + 3642643.
It is an arithmetic number, because the mean of its divisors is an integer number (15436951632).
Almost surely, 2123131141143 is an apocalyptic number.
123131141143 is a deficient number, since it is larger than the sum of its proper divisors (364471913).
123131141143 is a wasteful number, since it uses less digits than its factorization.
123131141143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44585.
The product of its digits is 864, while the sum is 25.
Adding to 123131141143 its reverse (341141131321), we get a palindrome (464272272464).
The spelling of 123131141143 in words is "one hundred twenty-three billion, one hundred thirty-one million, one hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •