Base | Representation |
---|---|
bin | 11000100001011… |
… | …101110011101111 |
3 | 1001200011121102011 |
4 | 120201131303233 |
5 | 1320311113111 |
6 | 104454142051 |
7 | 13124030542 |
oct | 3041356357 |
9 | 1050147364 |
10 | 411426031 |
11 | 1a126a515 |
12 | b5951927 |
13 | 67312273 |
14 | 3c8da859 |
15 | 261be021 |
hex | 1885dcef |
411426031 has 2 divisors, whose sum is σ = 411426032. Its totient is φ = 411426030.
The previous prime is 411426011. The next prime is 411426053. The reversal of 411426031 is 130624114.
It is an a-pointer prime, because the next prime (411426053) can be obtained adding 411426031 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 411426031 - 221 = 409328879 is a prime.
It is a super-2 number, since 2×4114260312 = 338542757968825922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 411425993 and 411426011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (411426011) 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 as a sum of consecutive naturals, namely, 205713015 + 205713016.
It is an arithmetic number, because the mean of its divisors is an integer number (205713016).
Almost surely, 2411426031 is an apocalyptic number.
411426031 is the 12829-th centered pentagonal number.
411426031 is a deficient number, since it is larger than the sum of its proper divisors (1).
411426031 is an equidigital number, since it uses as much as digits as its factorization.
411426031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 411426031 is about 20283.6394909789. The cubic root of 411426031 is about 743.7561822710.
The spelling of 411426031 in words is "four hundred eleven million, four hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •