Base | Representation |
---|---|
bin | 11000100110000… |
… | …111100000000101 |
3 | 1001202110120001021 |
4 | 120212013200011 |
5 | 1321114123011 |
6 | 104540231141 |
7 | 13140266521 |
oct | 3046074005 |
9 | 1052416037 |
10 | 412645381 |
11 | 1a1a22645 |
12 | b623b4b1 |
13 | 6764b285 |
14 | 3cb36d81 |
15 | 26360471 |
hex | 18987805 |
412645381 has 2 divisors, whose sum is σ = 412645382. Its totient is φ = 412645380.
The previous prime is 412645357. The next prime is 412645399. The reversal of 412645381 is 183546214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 276922881 + 135722500 = 16641^2 + 11650^2 .
It is a cyclic number.
It is not a de Polignac number, because 412645381 - 27 = 412645253 is a prime.
It is a super-2 number, since 2×4126453812 = 340552420921270322, which contains 22 as substring.
It is equal to p21974074 and since 412645381 and 21974074 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (412685381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206322690 + 206322691.
It is an arithmetic number, because the mean of its divisors is an integer number (206322691).
Almost surely, 2412645381 is an apocalyptic number.
It is an amenable number.
412645381 is a deficient number, since it is larger than the sum of its proper divisors (1).
412645381 is an equidigital number, since it uses as much as digits as its factorization.
412645381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 34.
The square root of 412645381 is about 20313.6747291080. The cubic root of 412645381 is about 744.4902183425.
The spelling of 412645381 in words is "four hundred twelve million, six hundred forty-five thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •