Base | Representation |
---|---|
bin | 1100111011001… |
… | …1000001011001 |
3 | 10210000012000211 |
4 | 3032303001121 |
5 | 102334220044 |
6 | 5213531121 |
7 | 1225532353 |
oct | 316630131 |
9 | 123005024 |
10 | 54210649 |
11 | 28667299 |
12 | 161a3aa1 |
13 | b300b0c |
14 | 72b20d3 |
15 | 4b5c634 |
hex | 33b3059 |
54210649 has 2 divisors, whose sum is σ = 54210650. Its totient is φ = 54210648.
The previous prime is 54210647. The next prime is 54210683. The reversal of 54210649 is 94601245.
54210649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52128400 + 2082249 = 7220^2 + 1443^2 .
It is a cyclic number.
It is not a de Polignac number, because 54210649 - 21 = 54210647 is a prime.
Together with 54210647, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 54210649.
It is not a weakly prime, because it can be changed into another prime (54210641) 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, 27105324 + 27105325.
It is an arithmetic number, because the mean of its divisors is an integer number (27105325).
Almost surely, 254210649 is an apocalyptic number.
It is an amenable number.
54210649 is a deficient number, since it is larger than the sum of its proper divisors (1).
54210649 is an equidigital number, since it uses as much as digits as its factorization.
54210649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 54210649 is about 7362.7881267900. The cubic root of 54210649 is about 378.4671608082.
The spelling of 54210649 in words is "fifty-four million, two hundred ten thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •