Base | Representation |
---|---|
bin | 11000011101101… |
… | …010111110111101 |
3 | 1001121022002001202 |
4 | 120131222332331 |
5 | 1320032301141 |
6 | 104420545245 |
7 | 13112416031 |
oct | 3035527675 |
9 | 1047262052 |
10 | 410431421 |
11 | 1a0750224 |
12 | b5552225 |
13 | 6705463a |
14 | 3c71c1c1 |
15 | 2607449b |
hex | 1876afbd |
410431421 has 8 divisors (see below), whose sum is σ = 415460160. Its totient is φ = 405412128.
The previous prime is 410431409. The next prime is 410431423. The reversal of 410431421 is 124134014.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-410431421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 410431393 and 410431402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (410431423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127190 + ... + 130376.
It is an arithmetic number, because the mean of its divisors is an integer number (51932520).
Almost surely, 2410431421 is an apocalyptic number.
It is an amenable number.
410431421 is a deficient number, since it is larger than the sum of its proper divisors (5028739).
410431421 is a wasteful number, since it uses less digits than its factorization.
410431421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4723.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 410431421 is about 20259.1071126049. The cubic root of 410431421 is about 743.1563626289.
Adding to 410431421 its reverse (124134014), we get a palindrome (534565435).
The spelling of 410431421 in words is "four hundred ten million, four hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •