Base | Representation |
---|---|
bin | 101110111101111100101001… |
… | …1011101000111100110001001 |
3 | 2000011210020212000002020121012 |
4 | 1131323321103131013212021 |
5 | 413122243023403010312 |
6 | 4022355140155453305 |
7 | 153006653123540423 |
oct | 13573712335074611 |
9 | 2004706760066535 |
10 | 413134304344457 |
11 | 10a701302460193 |
12 | 3a404242757235 |
13 | 1496a522a8b777 |
14 | 7403b42673813 |
15 | 32b688846a322 |
hex | 177be53747989 |
413134304344457 has 2 divisors, whose sum is σ = 413134304344458. Its totient is φ = 413134304344456.
The previous prime is 413134304344429. The next prime is 413134304344471. The reversal of 413134304344457 is 754443403431314.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 346232766943561 + 66901537400896 = 18607331^2 + 8179336^2 .
It is a cyclic number.
It is not a de Polignac number, because 413134304344457 - 232 = 413130009377161 is a prime.
It is not a weakly prime, because it can be changed into another prime (413134304344757) 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, 206567152172228 + 206567152172229.
It is an arithmetic number, because the mean of its divisors is an integer number (206567152172229).
Almost surely, 2413134304344457 is an apocalyptic number.
It is an amenable number.
413134304344457 is a deficient number, since it is larger than the sum of its proper divisors (1).
413134304344457 is an equidigital number, since it uses as much as digits as its factorization.
413134304344457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 50.
The spelling of 413134304344457 in words is "four hundred thirteen trillion, one hundred thirty-four billion, three hundred four million, three hundred forty-four thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •