Base | Representation |
---|---|
bin | 101000001010010110… |
… | …000011011001110111 |
3 | 11010022022221212110002 |
4 | 220022112003121313 |
5 | 1201304021214411 |
6 | 31451024221515 |
7 | 3054430242431 |
oct | 501226033167 |
9 | 133268855402 |
10 | 43123226231 |
11 | 17319a34148 |
12 | 8435a6a89b |
13 | 40b3150317 |
14 | 21312cd651 |
15 | 11c5cbc33b |
hex | a0a583677 |
43123226231 has 2 divisors, whose sum is σ = 43123226232. Its totient is φ = 43123226230.
The previous prime is 43123226221. The next prime is 43123226233. The reversal of 43123226231 is 13262232134.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 43123226231 - 214 = 43123209847 is a prime.
It is a super-2 number, since 2×431232262312 (a number of 22 digits) contains 22 as substring.
Together with 43123226233, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 43123226194 and 43123226203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43123226233) 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, 21561613115 + 21561613116.
It is an arithmetic number, because the mean of its divisors is an integer number (21561613116).
Almost surely, 243123226231 is an apocalyptic number.
43123226231 is a deficient number, since it is larger than the sum of its proper divisors (1).
43123226231 is an equidigital number, since it uses as much as digits as its factorization.
43123226231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 29.
Adding to 43123226231 its reverse (13262232134), we get a palindrome (56385458365).
The spelling of 43123226231 in words is "forty-three billion, one hundred twenty-three million, two hundred twenty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •