Base | Representation |
---|---|
bin | 100000100001110… |
… | …100101110110001 |
3 | 1102000220100022112 |
4 | 200201310232301 |
5 | 2104202101044 |
6 | 130053015105 |
7 | 16344456602 |
oct | 4041645661 |
9 | 1360810275 |
10 | 545737649 |
11 | 260066856 |
12 | 132924495 |
13 | 890aa3b2 |
14 | 5269dda9 |
15 | 32da009e |
hex | 20874bb1 |
545737649 has 2 divisors, whose sum is σ = 545737650. Its totient is φ = 545737648.
The previous prime is 545737597. The next prime is 545737651. The reversal of 545737649 is 946737545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 441840400 + 103897249 = 21020^2 + 10193^2 .
It is a cyclic number.
It is not a de Polignac number, because 545737649 - 212 = 545733553 is a prime.
It is a Sophie Germain prime.
Together with 545737651, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 545737597 and 545737606.
It is not a weakly prime, because it can be changed into another prime (545737949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 272868824 + 272868825.
It is an arithmetic number, because the mean of its divisors is an integer number (272868825).
Almost surely, 2545737649 is an apocalyptic number.
It is an amenable number.
545737649 is a deficient number, since it is larger than the sum of its proper divisors (1).
545737649 is an equidigital number, since it uses as much as digits as its factorization.
545737649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3175200, while the sum is 50.
The square root of 545737649 is about 23361.0284234235. The cubic root of 545737649 is about 817.1992735276.
The spelling of 545737649 in words is "five hundred forty-five million, seven hundred thirty-seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •