Base | Representation |
---|---|
bin | 1100111100000… |
… | …1110000111001 |
3 | 10210010020212021 |
4 | 3033001300321 |
5 | 102343133113 |
6 | 5215114441 |
7 | 1226203405 |
oct | 317016071 |
9 | 123106767 |
10 | 54271033 |
11 | 286a86a3 |
12 | 16212a21 |
13 | b32244b |
14 | 72ca105 |
15 | 4b7048d |
hex | 33c1c39 |
54271033 has 2 divisors, whose sum is σ = 54271034. Its totient is φ = 54271032.
The previous prime is 54271027. The next prime is 54271057. The reversal of 54271033 is 33017245.
54271033 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., 52823824 + 1447209 = 7268^2 + 1203^2 .
It is a cyclic number.
It is not a de Polignac number, because 54271033 - 25 = 54271001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54270989 and 54271007.
It is not a weakly prime, because it can be changed into another prime (54271433) 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, 27135516 + 27135517.
It is an arithmetic number, because the mean of its divisors is an integer number (27135517).
Almost surely, 254271033 is an apocalyptic number.
It is an amenable number.
54271033 is a deficient number, since it is larger than the sum of its proper divisors (1).
54271033 is an equidigital number, since it uses as much as digits as its factorization.
54271033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 54271033 is about 7366.8876060383. The cubic root of 54271033 is about 378.6076306324.
Adding to 54271033 its reverse (33017245), we get a palindrome (87288278).
The spelling of 54271033 in words is "fifty-four million, two hundred seventy-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •