Base | Representation |
---|---|
bin | 100000011000001… |
… | …110001000000111 |
3 | 1101212011110001211 |
4 | 200120032020013 |
5 | 2103031021411 |
6 | 125523032251 |
7 | 16314203311 |
oct | 4030161007 |
9 | 1355143054 |
10 | 543220231 |
11 | 2596a7444 |
12 | 131b0b687 |
13 | 887085b8 |
14 | 522067b1 |
15 | 32a54221 |
hex | 2060e207 |
543220231 has 2 divisors, whose sum is σ = 543220232. Its totient is φ = 543220230.
The previous prime is 543220123. The next prime is 543220253. The reversal of 543220231 is 132022345.
Together with previous prime (543220123) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (543220253) can be obtained adding 543220231 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 543220231 - 27 = 543220103 is a prime.
It is a super-2 number, since 2×5432202312 = 590176438735386722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (543220291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 271610115 + 271610116.
It is an arithmetic number, because the mean of its divisors is an integer number (271610116).
Almost surely, 2543220231 is an apocalyptic number.
543220231 is a deficient number, since it is larger than the sum of its proper divisors (1).
543220231 is an equidigital number, since it uses as much as digits as its factorization.
543220231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 543220231 is about 23307.0854248231. The cubic root of 543220231 is about 815.9407912113.
Adding to 543220231 its reverse (132022345), we get a palindrome (675242576).
The spelling of 543220231 in words is "five hundred forty-three million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •