Base | Representation |
---|---|
bin | 1100000001010101010… |
… | …00110110001101100101 |
3 | 1110111002220222022001110 |
4 | 12000222220312031211 |
5 | 23231342221230201 |
6 | 513424441415233 |
7 | 41561215604103 |
oct | 6005250661545 |
9 | 1414086868043 |
10 | 413032211301 |
11 | 14a190a08666 |
12 | 6806b79a519 |
13 | 2cc445aa688 |
14 | 15dc2d14c73 |
15 | ab25aae6d6 |
hex | 602aa36365 |
413032211301 has 8 divisors (see below), whose sum is σ = 550718291200. Its totient is φ = 275350469472.
The previous prime is 413032211257. The next prime is 413032211329. The reversal of 413032211301 is 103112230314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 413032211301 - 213 = 413032203109 is a prime.
It is a super-2 number, since 2×4130322113012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413032211381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 855445 + ... + 1248138.
It is an arithmetic number, because the mean of its divisors is an integer number (68839786400).
Almost surely, 2413032211301 is an apocalyptic number.
It is an amenable number.
413032211301 is a deficient number, since it is larger than the sum of its proper divisors (137686079899).
413032211301 is a wasteful number, since it uses less digits than its factorization.
413032211301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2169035.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 413032211301 its reverse (103112230314), we get a palindrome (516144441615).
The spelling of 413032211301 in words is "four hundred thirteen billion, thirty-two million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •