Base | Representation |
---|---|
bin | 1001101110110001… |
… | …10010111011010111 |
3 | 111111002021120122222 |
4 | 10313120302323113 |
5 | 41144344323411 |
6 | 2222221012555 |
7 | 243314042165 |
oct | 46730627327 |
9 | 14432246588 |
10 | 5224214231 |
11 | 2240a29525 |
12 | 10196b415b |
13 | 653443532 |
14 | 377b88235 |
15 | 2089954db |
hex | 137632ed7 |
5224214231 has 2 divisors, whose sum is σ = 5224214232. Its totient is φ = 5224214230.
The previous prime is 5224214213. The next prime is 5224214269. The reversal of 5224214231 is 1324124225.
Together with previous prime (5224214213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5224214231 - 230 = 4150472407 is a prime.
It is a super-2 number, since 2×52242142312 = 54584828662765842722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5224214231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5224214201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2612107115 + 2612107116.
It is an arithmetic number, because the mean of its divisors is an integer number (2612107116).
Almost surely, 25224214231 is an apocalyptic number.
5224214231 is a deficient number, since it is larger than the sum of its proper divisors (1).
5224214231 is an equidigital number, since it uses as much as digits as its factorization.
5224214231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3840, while the sum is 26.
The square root of 5224214231 is about 72278.7259918159. The cubic root of 5224214231 is about 1735.1631901692.
Adding to 5224214231 its reverse (1324124225), we get a palindrome (6548338456).
The spelling of 5224214231 in words is "five billion, two hundred twenty-four million, two hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •