Base | Representation |
---|---|
bin | 1100111100101… |
… | …0100000110101 |
3 | 10210012002000112 |
4 | 3033022200311 |
5 | 102400304434 |
6 | 5215552405 |
7 | 1226413031 |
oct | 317124065 |
9 | 123162015 |
10 | 54306869 |
11 | 28722611 |
12 | 1622b705 |
13 | b335856 |
14 | 72d91c1 |
15 | 4b7adce |
hex | 33ca835 |
54306869 has 2 divisors, whose sum is σ = 54306870. Its totient is φ = 54306868.
The previous prime is 54306829. The next prime is 54306877. The reversal of 54306869 is 96860345.
54306869 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., 52388644 + 1918225 = 7238^2 + 1385^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54306869 is a prime.
It is a super-2 number, since 2×543068692 = 5898472041166322, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54306829) 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, 27153434 + 27153435.
It is an arithmetic number, because the mean of its divisors is an integer number (27153435).
Almost surely, 254306869 is an apocalyptic number.
It is an amenable number.
54306869 is a deficient number, since it is larger than the sum of its proper divisors (1).
54306869 is an equidigital number, since it uses as much as digits as its factorization.
54306869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 41.
The square root of 54306869 is about 7369.3194394055. The cubic root of 54306869 is about 378.6909457827.
The spelling of 54306869 in words is "fifty-four million, three hundred six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •