Base | Representation |
---|---|
bin | 1001101110101100… |
… | …01111001001001101 |
3 | 111111001000111102101 |
4 | 10313112033021031 |
5 | 41144211341443 |
6 | 2222154355101 |
7 | 243305246266 |
oct | 46726171115 |
9 | 14431014371 |
10 | 5223543373 |
11 | 22406104a4 |
12 | 101942ba91 |
13 | 65326a089 |
14 | 377a5196d |
15 | 2088b184d |
hex | 13758f24d |
5223543373 has 2 divisors, whose sum is σ = 5223543374. Its totient is φ = 5223543372.
The previous prime is 5223543371. The next prime is 5223543421. The reversal of 5223543373 is 3733453225.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2890460169 + 2333083204 = 53763^2 + 48302^2 .
It is a cyclic number.
It is not a de Polignac number, because 5223543373 - 21 = 5223543371 is a prime.
It is a super-2 number, since 2×52235433732 = 54570810739224434258, which contains 22 as substring.
Together with 5223543371, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5223543371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2611771686 + 2611771687.
It is an arithmetic number, because the mean of its divisors is an integer number (2611771687).
Almost surely, 25223543373 is an apocalyptic number.
It is an amenable number.
5223543373 is a deficient number, since it is larger than the sum of its proper divisors (1).
5223543373 is an equidigital number, since it uses as much as digits as its factorization.
5223543373 is an evil number, because the sum of its binary digits is even.
The product of its digits is 226800, while the sum is 37.
The square root of 5223543373 is about 72274.0850720367. The cubic root of 5223543373 is about 1735.0889143779.
Adding to 5223543373 its reverse (3733453225), we get a palindrome (8956996598).
The spelling of 5223543373 in words is "five billion, two hundred twenty-three million, five hundred forty-three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •