Base | Representation |
---|---|
bin | 111001111001101101… |
… | …1011100000000111011 |
3 | 102212221200120000002201 |
4 | 1303303123130000323 |
5 | 4014123320443121 |
6 | 133042241011031 |
7 | 11661224153230 |
oct | 1636333340073 |
9 | 385850500081 |
10 | 124343140411 |
11 | 48808508866 |
12 | 20122323a77 |
13 | b957c2c939 |
14 | 603809d787 |
15 | 337b40be91 |
hex | 1cf36dc03b |
124343140411 has 4 divisors (see below), whose sum is σ = 142106446192. Its totient is φ = 106579834632.
The previous prime is 124343140387. The next prime is 124343140421. The reversal of 124343140411 is 114041343421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 124343140411 - 25 = 124343140379 is a prime.
It is a super-2 number, since 2×1243431404112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 124343140411.
It is not an unprimeable number, because it can be changed into a prime (124343140421) 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, 8881652880 + ... + 8881652893.
It is an arithmetic number, because the mean of its divisors is an integer number (35526611548).
Almost surely, 2124343140411 is an apocalyptic number.
124343140411 is a deficient number, since it is larger than the sum of its proper divisors (17763305781).
124343140411 is an equidigital number, since it uses as much as digits as its factorization.
124343140411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17763305780.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 124343140411 its reverse (114041343421), we get a palindrome (238384483832).
The spelling of 124343140411 in words is "one hundred twenty-four billion, three hundred forty-three million, one hundred forty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •