Base | Representation |
---|---|
bin | 1100111001100… |
… | …0111000110001 |
3 | 10202210202012002 |
4 | 3032120320301 |
5 | 102322303401 |
6 | 5211343345 |
7 | 1224605306 |
oct | 316307061 |
9 | 122722162 |
10 | 54103601 |
11 | 285a3922 |
12 | 16151b55 |
13 | b294186 |
14 | 72850ad |
15 | 4b3aa6b |
hex | 3398e31 |
54103601 has 2 divisors, whose sum is σ = 54103602. Its totient is φ = 54103600.
The previous prime is 54103597. The next prime is 54103603. The reversal of 54103601 is 10630145.
54103601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42706225 + 11397376 = 6535^2 + 3376^2 .
It is a cyclic number.
It is not a de Polignac number, because 54103601 - 22 = 54103597 is a prime.
Together with 54103603, 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 (54103603) 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, 27051800 + 27051801.
It is an arithmetic number, because the mean of its divisors is an integer number (27051801).
Almost surely, 254103601 is an apocalyptic number.
It is an amenable number.
54103601 is a deficient number, since it is larger than the sum of its proper divisors (1).
54103601 is an equidigital number, since it uses as much as digits as its factorization.
54103601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 54103601 is about 7355.5150057627. The cubic root of 54103601 is about 378.2178810696.
Adding to 54103601 its reverse (10630145), we get a palindrome (64733746).
The spelling of 54103601 in words is "fifty-four million, one hundred three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •