Base | Representation |
---|---|
bin | 111100000001000100001… |
… | …010001111110110011101 |
3 | 112121021120101220210010102 |
4 | 330001010022033312131 |
5 | 1020033042402004323 |
6 | 12434403254350445 |
7 | 603654204526565 |
oct | 74010412176635 |
9 | 15537511823112 |
10 | 4124312141213 |
11 | 1350124757260 |
12 | 56739b95b425 |
13 | 23bbc8493644 |
14 | 10389124dda5 |
15 | 724397e2328 |
hex | 3c04428fd9d |
4124312141213 has 8 divisors (see below), whose sum is σ = 4510997001216. Its totient is φ = 3739585180000.
The previous prime is 4124312141203. The next prime is 4124312141227. The reversal of 4124312141213 is 3121412134214.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4124312141213 is a prime.
It is a super-2 number, since 2×41243121412132 (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 (4124312141203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489470288 + ... + 489478713.
It is an arithmetic number, because the mean of its divisors is an integer number (563874625152).
Almost surely, 24124312141213 is an apocalyptic number.
It is an amenable number.
4124312141213 is a deficient number, since it is larger than the sum of its proper divisors (386684860003).
4124312141213 is a wasteful number, since it uses less digits than its factorization.
4124312141213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 978949395.
The product of its digits is 4608, while the sum is 29.
Adding to 4124312141213 its reverse (3121412134214), we get a palindrome (7245724275427).
The spelling of 4124312141213 in words is "four trillion, one hundred twenty-four billion, three hundred twelve million, one hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •