Base | Representation |
---|---|
bin | 11000010000010… |
… | …100110111001101 |
3 | 1001100201100001102 |
4 | 120100110313031 |
5 | 1313133323231 |
6 | 104213552445 |
7 | 13040605262 |
oct | 3020246715 |
9 | 1040640042 |
10 | 406932941 |
11 | 199780818 |
12 | b4345725 |
13 | 663cb12c |
14 | 3c08b269 |
15 | 25ad2acb |
hex | 18414dcd |
406932941 has 2 divisors, whose sum is σ = 406932942. Its totient is φ = 406932940.
The previous prime is 406932931. The next prime is 406932947. The reversal of 406932941 is 149239604.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 229643716 + 177289225 = 15154^2 + 13315^2 .
It is a cyclic number.
It is not a de Polignac number, because 406932941 - 214 = 406916557 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 406932895 and 406932904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (406932947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203466470 + 203466471.
It is an arithmetic number, because the mean of its divisors is an integer number (203466471).
Almost surely, 2406932941 is an apocalyptic number.
It is an amenable number.
406932941 is a deficient number, since it is larger than the sum of its proper divisors (1).
406932941 is an equidigital number, since it uses as much as digits as its factorization.
406932941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 38.
The square root of 406932941 is about 20172.5789377561. The cubic root of 406932941 is about 741.0388022004.
It can be divided in two parts, 40693 and 2941, that added together give a palindrome (43634).
The spelling of 406932941 in words is "four hundred six million, nine hundred thirty-two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •