Base | Representation |
---|---|
bin | 1100000001100010011… |
… | …00011101101010010101 |
3 | 1110111101120221212120120 |
4 | 12000301030131222111 |
5 | 23232103401224341 |
6 | 513443411222153 |
7 | 41564022565425 |
oct | 6006114355225 |
9 | 1414346855516 |
10 | 413142211221 |
11 | 14a23800a193 |
12 | 680a05a7959 |
13 | 2cc6131299c |
14 | 15dd378a485 |
15 | ab3058c066 |
hex | 603131da95 |
413142211221 has 8 divisors (see below), whose sum is σ = 583259592384. Its totient is φ = 259226485440.
The previous prime is 413142211189. The next prime is 413142211241. The reversal of 413142211221 is 122112241314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 413142211221 - 25 = 413142211189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 413142211191 and 413142211200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413142211241) 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, 4050413785 + ... + 4050413886.
It is an arithmetic number, because the mean of its divisors is an integer number (72907449048).
Almost surely, 2413142211221 is an apocalyptic number.
It is an amenable number.
413142211221 is a deficient number, since it is larger than the sum of its proper divisors (170117381163).
413142211221 is a wasteful number, since it uses less digits than its factorization.
413142211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8100827691.
The product of its digits is 768, while the sum is 24.
Adding to 413142211221 its reverse (122112241314), we get a palindrome (535254452535).
The spelling of 413142211221 in words is "four hundred thirteen billion, one hundred forty-two million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •