Base | Representation |
---|---|
bin | 1010001000011011… |
… | …00100110111001111 |
3 | 112001002010222021202 |
4 | 11010031210313033 |
5 | 42114440024342 |
6 | 2255424420115 |
7 | 251535640352 |
oct | 50415446717 |
9 | 15032128252 |
10 | 5439376847 |
11 | 2341428373 |
12 | 107977763b |
13 | 688ba91a8 |
14 | 398596299 |
15 | 21c7e7332 |
hex | 144364dcf |
5439376847 has 2 divisors, whose sum is σ = 5439376848. Its totient is φ = 5439376846.
The previous prime is 5439376837. The next prime is 5439376849. The reversal of 5439376847 is 7486739345.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5439376847 - 226 = 5372267983 is a prime.
It is a super-2 number, since 2×54393768472 = 59173640967359322818, which contains 22 as substring.
Together with 5439376849, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5439376792 and 5439376801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5439376849) 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, 2719688423 + 2719688424.
It is an arithmetic number, because the mean of its divisors is an integer number (2719688424).
Almost surely, 25439376847 is an apocalyptic number.
5439376847 is a deficient number, since it is larger than the sum of its proper divisors (1).
5439376847 is an equidigital number, since it uses as much as digits as its factorization.
5439376847 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15240960, while the sum is 56.
The square root of 5439376847 is about 73752.1311353103. The cubic root of 5439376847 is about 1758.6647119460.
The spelling of 5439376847 in words is "five billion, four hundred thirty-nine million, three hundred seventy-six thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •