Base | Representation |
---|---|
bin | 1100000001010011111… |
… | …10000111110101100101 |
3 | 1110111002010220021112122 |
4 | 12000221332013311211 |
5 | 23231331334330201 |
6 | 513423401355325 |
7 | 41561021446043 |
oct | 6005176076545 |
9 | 1414063807478 |
10 | 413021011301 |
11 | 14a185658968 |
12 | 68067a98b45 |
13 | 2cc42188862 |
14 | 15dc163b393 |
15 | ab24aeae1b |
hex | 6029f87d65 |
413021011301 has 2 divisors, whose sum is σ = 413021011302. Its totient is φ = 413021011300.
The previous prime is 413021011289. The next prime is 413021011309. The reversal of 413021011301 is 103110120314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 375897741025 + 37123270276 = 613105^2 + 192674^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-413021011301 is a prime.
It is a super-2 number, since 2×4130210113012 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 413021011301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413021011309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206510505650 + 206510505651.
It is an arithmetic number, because the mean of its divisors is an integer number (206510505651).
Almost surely, 2413021011301 is an apocalyptic number.
It is an amenable number.
413021011301 is a deficient number, since it is larger than the sum of its proper divisors (1).
413021011301 is an equidigital number, since it uses as much as digits as its factorization.
413021011301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 413021011301 its reverse (103110120314), we get a palindrome (516131131615).
The spelling of 413021011301 in words is "four hundred thirteen billion, twenty-one million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •