Base | Representation |
---|---|
bin | 111100000001001011001… |
… | …101100010011100011001 |
3 | 112121021212122112012110201 |
4 | 330001023031202130121 |
5 | 1020033313143204223 |
6 | 12434423122142201 |
7 | 603660142222564 |
oct | 74011315423431 |
9 | 15537778465421 |
10 | 4124430444313 |
11 | 135018550a113 |
12 | 5674134b1961 |
13 | 23bc16b4508a |
14 | 1038a2c474db |
15 | 72444daeead |
hex | 3c04b362719 |
4124430444313 has 8 divisors (see below), whose sum is σ = 4154379134400. Its totient is φ = 4094511993840.
The previous prime is 4124430444307. The next prime is 4124430444341. The reversal of 4124430444313 is 3134440344214.
It is a happy number.
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 4124430444313 - 237 = 3986991490841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4124430544313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7286095 + ... + 7831732.
It is an arithmetic number, because the mean of its divisors is an integer number (519297391800).
Almost surely, 24124430444313 is an apocalyptic number.
It is an amenable number.
4124430444313 is a deficient number, since it is larger than the sum of its proper divisors (29948690087).
4124430444313 is a wasteful number, since it uses less digits than its factorization.
4124430444313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15119807.
The product of its (nonzero) digits is 221184, while the sum is 37.
Adding to 4124430444313 its reverse (3134440344214), we get a palindrome (7258870788527).
The spelling of 4124430444313 in words is "four trillion, one hundred twenty-four billion, four hundred thirty million, four hundred forty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •