Base | Representation |
---|---|
bin | 111001111100101010… |
… | …0111101011100100111 |
3 | 102220012120202221212112 |
4 | 1303321110331130213 |
5 | 4014324134340024 |
6 | 133100134111235 |
7 | 11663535305465 |
oct | 1637124753447 |
9 | 386176687775 |
10 | 124442105639 |
11 | 48859362905 |
12 | 2014b4ab51b |
13 | b9725a0447 |
14 | 60472a1835 |
15 | 3384e5a00e |
hex | 1cf953d727 |
124442105639 has 4 divisors (see below), whose sum is σ = 128733212760. Its totient is φ = 120150998520.
The previous prime is 124442105611. The next prime is 124442105647. The reversal of 124442105639 is 936501244421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 936501244421 = 1087 ⋅861546683.
It is not a de Polignac number, because 124442105639 - 212 = 124442101543 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124442105596 and 124442105605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124442105609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2145553517 + ... + 2145553574.
It is an arithmetic number, because the mean of its divisors is an integer number (32183303190).
Almost surely, 2124442105639 is an apocalyptic number.
124442105639 is a deficient number, since it is larger than the sum of its proper divisors (4291107121).
124442105639 is an equidigital number, since it uses as much as digits as its factorization.
124442105639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4291107120.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 124442105639 in words is "one hundred twenty-four billion, four hundred forty-two million, one hundred five thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •