Base | Representation |
---|---|
bin | 10001000011110… |
… | …01010111000111 |
3 | 100222021102000002 |
4 | 20201321113013 |
5 | 243113302211 |
6 | 22111111515 |
7 | 3355234112 |
oct | 1041712707 |
9 | 328242002 |
10 | 143103431 |
11 | 738617a9 |
12 | 3bb1259b |
13 | 23855ab3 |
14 | 15011579 |
15 | c86b03b |
hex | 88795c7 |
143103431 has 2 divisors, whose sum is σ = 143103432. Its totient is φ = 143103430.
The previous prime is 143103413. The next prime is 143103437. The reversal of 143103431 is 134301341.
143103431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (143103413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143103431 is a prime.
It is a super-2 number, since 2×1431034312 = 40957183927943522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143103437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71551715 + 71551716.
It is an arithmetic number, because the mean of its divisors is an integer number (71551716).
Almost surely, 2143103431 is an apocalyptic number.
143103431 is a deficient number, since it is larger than the sum of its proper divisors (1).
143103431 is an equidigital number, since it uses as much as digits as its factorization.
143103431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 143103431 is about 11962.5846287498. The cubic root of 143103431 is about 523.0582006358.
Adding to 143103431 its reverse (134301341), we get a palindrome (277404772).
The spelling of 143103431 in words is "one hundred forty-three million, one hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •