Base | Representation |
---|---|
bin | 111001111001101001… |
… | …1100011100001111111 |
3 | 102212221112200000120201 |
4 | 1303303103203201333 |
5 | 4014122303332142 |
6 | 133042124424331 |
7 | 11661200455651 |
oct | 1636323434177 |
9 | 385845600521 |
10 | 124341074047 |
11 | 48807327323 |
12 | 201216a80a7 |
13 | b957688238 |
14 | 6037ac26d1 |
15 | 337b14eab7 |
hex | 1cf34e387f |
124341074047 has 4 divisors (see below), whose sum is σ = 128628697320. Its totient is φ = 120053450776.
The previous prime is 124341073993. The next prime is 124341074063. The reversal of 124341074047 is 740470143421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 740470143421 = 32801 ⋅22574621.
It is a cyclic number.
It is not a de Polignac number, because 124341074047 - 27 = 124341073919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 124341073997 and 124341074015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124341074087) 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, 2143811593 + ... + 2143811650.
It is an arithmetic number, because the mean of its divisors is an integer number (32157174330).
Almost surely, 2124341074047 is an apocalyptic number.
124341074047 is a deficient number, since it is larger than the sum of its proper divisors (4287623273).
124341074047 is an equidigital number, since it uses as much as digits as its factorization.
124341074047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4287623272.
The product of its (nonzero) digits is 75264, while the sum is 37.
The spelling of 124341074047 in words is "one hundred twenty-four billion, three hundred forty-one million, seventy-four thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •