Base | Representation |
---|---|
bin | 11000100100111… |
… | …101101110111111 |
3 | 1001201220012120112 |
4 | 120210331232333 |
5 | 1321024440411 |
6 | 104525540235 |
7 | 13134600566 |
oct | 3044755677 |
9 | 1051805515 |
10 | 412343231 |
11 | 1a1836633 |
12 | b611467b |
13 | 675738a1 |
14 | 3ca98bdd |
15 | 26300b8b |
hex | 1893dbbf |
412343231 has 2 divisors, whose sum is σ = 412343232. Its totient is φ = 412343230.
The previous prime is 412343209. The next prime is 412343249. The reversal of 412343231 is 132343214.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-412343231 is a prime.
It is a super-2 number, since 2×4123432312 = 340053880303038722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 412343197 and 412343206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (412343291) 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 as a sum of consecutive naturals, namely, 206171615 + 206171616.
It is an arithmetic number, because the mean of its divisors is an integer number (206171616).
Almost surely, 2412343231 is an apocalyptic number.
412343231 is a deficient number, since it is larger than the sum of its proper divisors (1).
412343231 is an equidigital number, since it uses as much as digits as its factorization.
412343231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 23.
The square root of 412343231 is about 20306.2362588442. The cubic root of 412343231 is about 744.3084620804.
Adding to 412343231 its reverse (132343214), we get a palindrome (544686445).
The spelling of 412343231 in words is "four hundred twelve million, three hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •