Base | Representation |
---|---|
bin | 1101000011111… |
… | …0011001110000 |
3 | 10211002012011101 |
4 | 3100332121300 |
5 | 103011002202 |
6 | 5234054144 |
7 | 1233430660 |
oct | 320763160 |
9 | 124065141 |
10 | 54781552 |
11 | 28a17211 |
12 | 1641a354 |
13 | b470927 |
14 | 73c01a0 |
15 | 4c21887 |
hex | 343e670 |
54781552 has 40 divisors (see below), whose sum is σ = 121679712. Its totient is φ = 23404800.
The previous prime is 54781549. The next prime is 54781553. The reversal of 54781552 is 25518745.
54781552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54781553) 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 in 7 ways as a sum of consecutive naturals, for example, 51102 + ... + 52162.
Almost surely, 254781552 is an apocalyptic number.
It is an amenable number.
54781552 is an abundant number, since it is smaller than the sum of its proper divisors (66898160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54781552 is a wasteful number, since it uses less digits than its factorization.
54781552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1537 (or 1531 counting only the distinct ones).
The product of its digits is 56000, while the sum is 37.
The square root of 54781552 is about 7401.4560729629. The cubic root of 54781552 is about 379.7910947782.
The spelling of 54781552 in words is "fifty-four million, seven hundred eighty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •