Base | Representation |
---|---|
bin | 11000100100001… |
… | …100101110110001 |
3 | 1001201112000020112 |
4 | 120210030232301 |
5 | 1321002030023 |
6 | 104521351105 |
7 | 13133103446 |
oct | 3044145661 |
9 | 1051460215 |
10 | 412142513 |
11 | 1a1709852 |
12 | b6038495 |
13 | 67503413 |
14 | 3ca459cd |
15 | 262b1478 |
hex | 1890cbb1 |
412142513 has 2 divisors, whose sum is σ = 412142514. Its totient is φ = 412142512.
The previous prime is 412142453. The next prime is 412142539. The reversal of 412142513 is 315241214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 319444129 + 92698384 = 17873^2 + 9628^2 .
It is a cyclic number.
It is not a de Polignac number, because 412142513 - 212 = 412138417 is a prime.
It is a super-2 number, since 2×4121425132 = 339722902043910338, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (412172513) 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, 206071256 + 206071257.
It is an arithmetic number, because the mean of its divisors is an integer number (206071257).
Almost surely, 2412142513 is an apocalyptic number.
It is an amenable number.
412142513 is a deficient number, since it is larger than the sum of its proper divisors (1).
412142513 is an equidigital number, since it uses as much as digits as its factorization.
412142513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 960, while the sum is 23.
The square root of 412142513 is about 20301.2933824424. The cubic root of 412142513 is about 744.1876724550.
Adding to 412142513 its reverse (315241214), we get a palindrome (727383727).
The spelling of 412142513 in words is "four hundred twelve million, one hundred forty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •