Base | Representation |
---|---|
bin | 111001010010000001… |
… | …1000010001100100111 |
3 | 102202111212112200200222 |
4 | 1302210003002030213 |
5 | 4003411400440033 |
6 | 132302143554555 |
7 | 11613223110323 |
oct | 1624403021447 |
9 | 382455480628 |
10 | 123011343143 |
11 | 48194772867 |
12 | 1ba102bba5b |
13 | b7a5040910 |
14 | 5d4d262983 |
15 | 32ee53a598 |
hex | 1ca40c2327 |
123011343143 has 4 divisors (see below), whose sum is σ = 132473754168. Its totient is φ = 113548932120.
The previous prime is 123011343113. The next prime is 123011343157. The reversal of 123011343143 is 341343110321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 341343110321 = 19 ⋅17965426859.
It is a de Polignac number, because none of the positive numbers 2k-123011343143 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123011343113) 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, 4731205493 + ... + 4731205518.
It is an arithmetic number, because the mean of its divisors is an integer number (33118438542).
Almost surely, 2123011343143 is an apocalyptic number.
123011343143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
123011343143 is a deficient number, since it is larger than the sum of its proper divisors (9462411025).
123011343143 is an equidigital number, since it uses as much as digits as its factorization.
123011343143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9462411024.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 123011343143 its reverse (341343110321), we get a palindrome (464354453464).
The spelling of 123011343143 in words is "one hundred twenty-three billion, eleven million, three hundred forty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •