Base | Representation |
---|---|
bin | 1001010111110001… |
… | …01010111100000011 |
3 | 110222122011122121201 |
4 | 10223320222330003 |
5 | 40300444243043 |
6 | 2151125002031 |
7 | 235451602315 |
oct | 45370527403 |
9 | 13878148551 |
10 | 5031243523 |
11 | 21520077a9 |
12 | b84b53317 |
13 | 62247a897 |
14 | 35a2b57b5 |
15 | 1e6a78c4d |
hex | 12be2af03 |
5031243523 has 2 divisors, whose sum is σ = 5031243524. Its totient is φ = 5031243522.
The previous prime is 5031243521. The next prime is 5031243559. The reversal of 5031243523 is 3253421305.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5031243523 - 21 = 5031243521 is a prime.
It is a super-2 number, since 2×50312435232 = 50626822775458903058, which contains 22 as substring.
Together with 5031243521, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5031243491 and 5031243500.
It is not a weakly prime, because it can be changed into another prime (5031243521) 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, 2515621761 + 2515621762.
It is an arithmetic number, because the mean of its divisors is an integer number (2515621762).
Almost surely, 25031243523 is an apocalyptic number.
5031243523 is a deficient number, since it is larger than the sum of its proper divisors (1).
5031243523 is an equidigital number, since it uses as much as digits as its factorization.
5031243523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 28.
The square root of 5031243523 is about 70931.2591386900. The cubic root of 5031243523 is about 1713.5302651508.
Adding to 5031243523 its reverse (3253421305), we get a palindrome (8284664828).
The spelling of 5031243523 in words is "five billion, thirty-one million, two hundred forty-three thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •