Base | Representation |
---|---|
bin | 1101000011110… |
… | …0110000010001 |
3 | 10211001211220100 |
4 | 3100330300101 |
5 | 103010243201 |
6 | 5234003013 |
7 | 1233402204 |
oct | 320746021 |
9 | 124054810 |
10 | 54774801 |
11 | 28a12134 |
12 | 16416469 |
13 | b46a833 |
14 | 73bb93b |
15 | 4c1e886 |
hex | 343cc11 |
54774801 has 9 divisors (see below), whose sum is σ = 79151241. Its totient is φ = 36501732.
The previous prime is 54774793. The next prime is 54774803. The reversal of 54774801 is 10847745.
The square root of 54774801 is 7401.
It is a perfect power (a square), and thus also a powerful number.
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 54774801 - 23 = 54774793 is a prime.
It is a super-3 number, since 3×547748013 (a number of 24 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (54774803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 20970 + ... + 23436.
Almost surely, 254774801 is an apocalyptic number.
54774801 is the 7401-st square number.
54774801 is the 3701-st centered octagonal number.
It is an amenable number.
54774801 is a deficient number, since it is larger than the sum of its proper divisors (24376440).
54774801 is an frugal number, since it uses more digits than its factorization.
54774801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4940 (or 2470 counting only the distinct ones).
The product of its (nonzero) digits is 31360, while the sum is 36.
The cubic root of 54774801 is about 379.7754929627.
Multiplying 54774801 by its sum of digits (36), we get a square (1971892836 = 444062).
The spelling of 54774801 in words is "fifty-four million, seven hundred seventy-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •