Base | Representation |
---|---|
bin | 1100111010111… |
… | …1011000111101 |
3 | 10202222102121212 |
4 | 3032233120331 |
5 | 102333231043 |
6 | 5213334205 |
7 | 1225441112 |
oct | 316573075 |
9 | 122872555 |
10 | 54195773 |
11 | 286570a5 |
12 | 16197365 |
13 | b2c7108 |
14 | 72aa909 |
15 | 4b58018 |
hex | 33af63d |
54195773 has 2 divisors, whose sum is σ = 54195774. Its totient is φ = 54195772.
The previous prime is 54195767. The next prime is 54195811. The reversal of 54195773 is 37759145.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 44448889 + 9746884 = 6667^2 + 3122^2 .
It is a cyclic number.
It is not a de Polignac number, because 54195773 - 26 = 54195709 is a prime.
It is a super-2 number, since 2×541957732 = 5874363622135058, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 54195773.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54191773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27097886 + 27097887.
It is an arithmetic number, because the mean of its divisors is an integer number (27097887).
Almost surely, 254195773 is an apocalyptic number.
It is an amenable number.
54195773 is a deficient number, since it is larger than the sum of its proper divisors (1).
54195773 is an equidigital number, since it uses as much as digits as its factorization.
54195773 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 132300, while the sum is 41.
The square root of 54195773 is about 7361.7778423422. Note that the first 3 decimals coincide. The cubic root of 54195773 is about 378.4325391201.
The spelling of 54195773 in words is "fifty-four million, one hundred ninety-five thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •