Base | Representation |
---|---|
bin | 111100000000111000101… |
… | …101011100111000000101 |
3 | 112121021002000110011221021 |
4 | 330000320231130320011 |
5 | 1020032144212334023 |
6 | 12434332233151141 |
7 | 603646352652535 |
oct | 74007055347005 |
9 | 15537060404837 |
10 | 4124120043013 |
11 | 1350036281013 |
12 | 56734755b4b1 |
13 | 23bb97744b79 |
14 | 1038739274c5 |
15 | 724279e935d |
hex | 3c038b5ce05 |
4124120043013 has 16 divisors (see below), whose sum is σ = 4195680713280. Its totient is φ = 4053172608000.
The previous prime is 4124120043011. The next prime is 4124120043077. The reversal of 4124120043013 is 3103400214214.
It is a cyclic number.
It is not a de Polignac number, because 4124120043013 - 21 = 4124120043011 is a prime.
It is a super-2 number, since 2×41241200430132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4124120043011) 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 15 ways as a sum of consecutive naturals, for example, 87172581 + ... + 87219877.
It is an arithmetic number, because the mean of its divisors is an integer number (262230044580).
Almost surely, 24124120043013 is an apocalyptic number.
It is an amenable number.
4124120043013 is a deficient number, since it is larger than the sum of its proper divisors (71560670267).
4124120043013 is a wasteful number, since it uses less digits than its factorization.
4124120043013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53748.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4124120043013 its reverse (3103400214214), we get a palindrome (7227520257227).
The spelling of 4124120043013 in words is "four trillion, one hundred twenty-four billion, one hundred twenty million, forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •