Base | Representation |
---|---|
bin | 1010101011100111… |
… | …00111111101000001 |
3 | 112210122121000110021 |
4 | 11111303213331001 |
5 | 43221022014044 |
6 | 2345011333441 |
7 | 262051662313 |
oct | 52563477501 |
9 | 15718530407 |
10 | 5734563649 |
11 | 2483014601 |
12 | 11405b1281 |
13 | 7050b0239 |
14 | 3c58757b3 |
15 | 2386a4e84 |
hex | 155ce7f41 |
5734563649 has 2 divisors, whose sum is σ = 5734563650. Its totient is φ = 5734563648.
The previous prime is 5734563647. The next prime is 5734563689. The reversal of 5734563649 is 9463654375.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4908403600 + 826160049 = 70060^2 + 28743^2 .
It is a cyclic number.
It is not a de Polignac number, because 5734563649 - 21 = 5734563647 is a prime.
Together with 5734563647, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5734563596 and 5734563605.
It is not a weakly prime, because it can be changed into another prime (5734563643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2867281824 + 2867281825.
It is an arithmetic number, because the mean of its divisors is an integer number (2867281825).
Almost surely, 25734563649 is an apocalyptic number.
It is an amenable number.
5734563649 is a deficient number, since it is larger than the sum of its proper divisors (1).
5734563649 is an equidigital number, since it uses as much as digits as its factorization.
5734563649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8164800, while the sum is 52.
The square root of 5734563649 is about 75726.9017522835. The cubic root of 5734563649 is about 1789.9193339844.
The spelling of 5734563649 in words is "five billion, seven hundred thirty-four million, five hundred sixty-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •