Base | Representation |
---|---|
bin | 101111000011000011101111… |
… | …1010101001100001111111101 |
3 | 2000021021101221022021121022111 |
4 | 1132012013133111030033331 |
5 | 413220300111032331403 |
6 | 4024053545231214021 |
7 | 153111500655460462 |
oct | 13606073725141775 |
9 | 2007241838247274 |
10 | 413836730745853 |
11 | 10a952198894098 |
12 | 3a4b83b7977311 |
13 | 149bb836b2937c |
14 | 7429b39d0b669 |
15 | 32c9c9a56156d |
hex | 17861df54c3fd |
413836730745853 has 2 divisors, whose sum is σ = 413836730745854. Its totient is φ = 413836730745852.
The previous prime is 413836730745827. The next prime is 413836730745959. The reversal of 413836730745853 is 358547037638314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 411604688769849 + 2232041976004 = 20288043^2 + 1494002^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-413836730745853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413836730745353) by changing a digit.
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 as a sum of consecutive naturals, namely, 206918365372926 + 206918365372927.
It is an arithmetic number, because the mean of its divisors is an integer number (206918365372927).
Almost surely, 2413836730745853 is an apocalyptic number.
It is an amenable number.
413836730745853 is a deficient number, since it is larger than the sum of its proper divisors (1).
413836730745853 is an equidigital number, since it uses as much as digits as its factorization.
413836730745853 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 609638400, while the sum is 67.
The spelling of 413836730745853 in words is "four hundred thirteen trillion, eight hundred thirty-six billion, seven hundred thirty million, seven hundred forty-five thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •