Base | Representation |
---|---|
bin | 1001000111011110… |
… | …01101001010110001 |
3 | 110122002221121220012 |
4 | 10203233031022301 |
5 | 40011000411221 |
6 | 2125403024305 |
7 | 232201641134 |
oct | 44357151261 |
9 | 13562847805 |
10 | 4894544561 |
11 | 209192a855 |
12 | b4720b095 |
13 | 600057c1a |
14 | 34609021b |
15 | 1d9a7565b |
hex | 123bcd2b1 |
4894544561 has 2 divisors, whose sum is σ = 4894544562. Its totient is φ = 4894544560.
The previous prime is 4894544521. The next prime is 4894544563. The reversal of 4894544561 is 1654454984.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4797640225 + 96904336 = 69265^2 + 9844^2 .
It is a cyclic number.
It is not a de Polignac number, because 4894544561 - 26 = 4894544497 is a prime.
It is a super-2 number, since 2×48945445612 = 47913132919229365442, which contains 22 as substring.
Together with 4894544563, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (4894544563) 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, 2447272280 + 2447272281.
It is an arithmetic number, because the mean of its divisors is an integer number (2447272281).
Almost surely, 24894544561 is an apocalyptic number.
It is an amenable number.
4894544561 is a deficient number, since it is larger than the sum of its proper divisors (1).
4894544561 is an equidigital number, since it uses as much as digits as its factorization.
4894544561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2764800, while the sum is 50.
The square root of 4894544561 is about 69961.0217263870. The cubic root of 4894544561 is about 1697.8686740109.
The spelling of 4894544561 in words is "four billion, eight hundred ninety-four million, five hundred forty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •