Base | Representation |
---|---|
bin | 1101000101110… |
… | …0110010111001 |
3 | 10211022111221002 |
4 | 3101130302321 |
5 | 103023443131 |
6 | 5240454345 |
7 | 1234456631 |
oct | 321346271 |
9 | 124274832 |
10 | 54906041 |
11 | 28aa17a3 |
12 | 1647a3b5 |
13 | b4b54a8 |
14 | 74136c1 |
15 | 4c486cb |
hex | 345ccb9 |
54906041 has 2 divisors, whose sum is σ = 54906042. Its totient is φ = 54906040.
The previous prime is 54906023. The next prime is 54906043. The reversal of 54906041 is 14060945.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35581225 + 19324816 = 5965^2 + 4396^2 .
It is a cyclic number.
It is not a de Polignac number, because 54906041 - 214 = 54889657 is a prime.
It is a super-3 number, since 3×549060413 (a number of 24 digits) contains 333 as substring.
It is a Sophie Germain prime.
Together with 54906043, 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 = 54905995 and 54906013.
It is not a weakly prime, because it can be changed into another prime (54906043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27453020 + 27453021.
It is an arithmetic number, because the mean of its divisors is an integer number (27453021).
Almost surely, 254906041 is an apocalyptic number.
It is an amenable number.
54906041 is a deficient number, since it is larger than the sum of its proper divisors (1).
54906041 is an equidigital number, since it uses as much as digits as its factorization.
54906041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 29.
The square root of 54906041 is about 7409.8610648244. The cubic root of 54906041 is about 380.0785640884.
Adding to 54906041 its reverse (14060945), we get a palindrome (68966986).
The spelling of 54906041 in words is "fifty-four million, nine hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •