Base | Representation |
---|---|
bin | 1101000011100… |
… | …0001001101111 |
3 | 10211000220001012 |
4 | 3100320021233 |
5 | 103004142301 |
6 | 5233335435 |
7 | 1233263225 |
oct | 320701157 |
9 | 124026035 |
10 | 54755951 |
11 | 289a9a58 |
12 | 1640757b |
13 | b462093 |
14 | 73b4b15 |
15 | 4c18ebb |
hex | 343826f |
54755951 has 16 divisors (see below), whose sum is σ = 58856448. Its totient is φ = 50846400.
The previous prime is 54755917. The next prime is 54755957. The reversal of 54755951 is 15955745.
54755951 = 13142 + 13152 + ... + 13442.
54755951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 54755951 - 26 = 54755887 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54755899 and 54755908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54755957) 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 15 ways as a sum of consecutive naturals, for example, 84836 + ... + 85478.
It is an arithmetic number, because the mean of its divisors is an integer number (3678528).
Almost surely, 254755951 is an apocalyptic number.
54755951 is a deficient number, since it is larger than the sum of its proper divisors (4100497).
54755951 is a wasteful number, since it uses less digits than its factorization.
54755951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782.
The product of its digits is 157500, while the sum is 41.
The square root of 54755951 is about 7399.7264138615. The cubic root of 54755951 is about 379.7319231138.
The spelling of 54755951 in words is "fifty-four million, seven hundred fifty-five thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •