Base | Representation |
---|---|
bin | 101110111000110001111100… |
… | …0101100111001111101101001 |
3 | 2000002021100201111011211211111 |
4 | 1131301203320230321331221 |
5 | 413024124040202334200 |
6 | 4021053004352230321 |
7 | 152604441653524342 |
oct | 13561437054717551 |
9 | 2002240644154744 |
10 | 412424112152425 |
11 | 10a4580a148789a |
12 | 3a30a68083b3a1 |
13 | 14918571b81c89 |
14 | 73bb60d89b0c9 |
15 | 32a316e6de0ba |
hex | 17718f8b39f69 |
412424112152425 has 6 divisors (see below), whose sum is σ = 511405899069038. Its totient is φ = 329939289721920.
The previous prime is 412424112152383. The next prime is 412424112152443. The reversal of 412424112152425 is 524251211424214.
It can be written as a sum of positive squares in 3 ways, for example, as 129506767050816 + 282917345101609 = 11380104^2 + 16820147^2 .
It is a de Polignac number, because none of the positive numbers 2k-412424112152425 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8248482243024 + ... + 8248482243073.
Almost surely, 2412424112152425 is an apocalyptic number.
It is an amenable number.
412424112152425 is a deficient number, since it is larger than the sum of its proper divisors (98981786916613).
412424112152425 is a wasteful number, since it uses less digits than its factorization.
412424112152425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16496964486107 (or 16496964486102 counting only the distinct ones).
The product of its digits is 204800, while the sum is 40.
Adding to 412424112152425 its reverse (524251211424214), we get a palindrome (936675323576639).
The spelling of 412424112152425 in words is "four hundred twelve trillion, four hundred twenty-four billion, one hundred twelve million, one hundred fifty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •