Base | Representation |
---|---|
bin | 1100000001100100001… |
… | …00010000101010100101 |
3 | 1110111102121110222211002 |
4 | 12000302010100222211 |
5 | 23232121122304203 |
6 | 513445052523045 |
7 | 41564261115311 |
oct | 6006204205245 |
9 | 1414377428732 |
10 | 413156838053 |
11 | 14a24529a583 |
12 | 680a5480485 |
13 | 2cc6436450b |
14 | 15dd56b6b41 |
15 | ab319cad88 |
hex | 6032110aa5 |
413156838053 has 2 divisors, whose sum is σ = 413156838054. Its totient is φ = 413156838052.
The previous prime is 413156838001. The next prime is 413156838077. The reversal of 413156838053 is 350838651314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 410992541569 + 2164296484 = 641087^2 + 46522^2 .
It is a cyclic number.
It is not a de Polignac number, because 413156838053 - 210 = 413156837029 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 413156837989 and 413156838007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413156838253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206578419026 + 206578419027.
It is an arithmetic number, because the mean of its divisors is an integer number (206578419027).
Almost surely, 2413156838053 is an apocalyptic number.
It is an amenable number.
413156838053 is a deficient number, since it is larger than the sum of its proper divisors (1).
413156838053 is an equidigital number, since it uses as much as digits as its factorization.
413156838053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 47.
The spelling of 413156838053 in words is "four hundred thirteen billion, one hundred fifty-six million, eight hundred thirty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •