Base | Representation |
---|---|
bin | 1001100011101011… |
… | …10000100011011101 |
3 | 111020121011002110202 |
4 | 10301311300203131 |
5 | 41002033042024 |
6 | 2205054113245 |
7 | 241103666501 |
oct | 46165604335 |
9 | 14217132422 |
10 | 5131143389 |
11 | 21a343aa79 |
12 | bb24ab825 |
13 | 63a087928 |
14 | 36967c301 |
15 | 20070dbae |
hex | 131d708dd |
5131143389 has 2 divisors, whose sum is σ = 5131143390. Its totient is φ = 5131143388.
The previous prime is 5131143373. The next prime is 5131143427. The reversal of 5131143389 is 9833411315.
It is an a-pointer prime, because the next prime (5131143427) can be obtained adding 5131143389 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2990230489 + 2140912900 = 54683^2 + 46270^2 .
It is a cyclic number.
It is not a de Polignac number, because 5131143389 - 24 = 5131143373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5131143319) 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, 2565571694 + 2565571695.
It is an arithmetic number, because the mean of its divisors is an integer number (2565571695).
Almost surely, 25131143389 is an apocalyptic number.
It is an amenable number.
5131143389 is a deficient number, since it is larger than the sum of its proper divisors (1).
5131143389 is an equidigital number, since it uses as much as digits as its factorization.
5131143389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 38880, while the sum is 38.
The square root of 5131143389 is about 71631.9997556958. Note that the first 3 decimals coincide. The cubic root of 5131143389 is about 1724.7972472193.
The spelling of 5131143389 in words is "five billion, one hundred thirty-one million, one hundred forty-three thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •