Base | Representation |
---|---|
bin | 1100111100000… |
… | …0110011101001 |
3 | 10210010001111002 |
4 | 3033000303221 |
5 | 102343021423 |
6 | 5215044345 |
7 | 1226156105 |
oct | 317006351 |
9 | 123101432 |
10 | 54267113 |
11 | 286a575a |
12 | 162106b5 |
13 | b320724 |
14 | 72c8905 |
15 | 4b6e228 |
hex | 33c0ce9 |
54267113 has 2 divisors, whose sum is σ = 54267114. Its totient is φ = 54267112.
The previous prime is 54267107. The next prime is 54267131. The reversal of 54267113 is 31176245.
54267113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (54267131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28430224 + 25836889 = 5332^2 + 5083^2 .
It is a cyclic number.
It is not a de Polignac number, because 54267113 - 28 = 54266857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (54267133) 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, 27133556 + 27133557.
It is an arithmetic number, because the mean of its divisors is an integer number (27133557).
Almost surely, 254267113 is an apocalyptic number.
It is an amenable number.
54267113 is a deficient number, since it is larger than the sum of its proper divisors (1).
54267113 is an equidigital number, since it uses as much as digits as its factorization.
54267113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5040, while the sum is 29.
The square root of 54267113 is about 7366.6215458648. The cubic root of 54267113 is about 378.5985147956.
The spelling of 54267113 in words is "fifty-four million, two hundred sixty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •