Base | Representation |
---|---|
bin | 1100000001010011111… |
… | …10000111110110111111 |
3 | 1110111002010220021122222 |
4 | 12000221332013312333 |
5 | 23231331334331031 |
6 | 513423401355555 |
7 | 41561021446232 |
oct | 6005176076677 |
9 | 1414063807588 |
10 | 413021011391 |
11 | 14a185658a3a |
12 | 68067a98bbb |
13 | 2cc42188901 |
14 | 15dc163b419 |
15 | ab24aeae7b |
hex | 6029f87dbf |
413021011391 has 2 divisors, whose sum is σ = 413021011392. Its totient is φ = 413021011390.
The previous prime is 413021011349. The next prime is 413021011427. The reversal of 413021011391 is 193110120314.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-413021011391 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 413021011391.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413021011301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206510505695 + 206510505696.
It is an arithmetic number, because the mean of its divisors is an integer number (206510505696).
Almost surely, 2413021011391 is an apocalyptic number.
413021011391 is a deficient number, since it is larger than the sum of its proper divisors (1).
413021011391 is an equidigital number, since it uses as much as digits as its factorization.
413021011391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 413021011391 in words is "four hundred thirteen billion, twenty-one million, eleven thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •