Base | Representation |
---|---|
bin | 1101001010111… |
… | …0000001011110 |
3 | 10211221102022122 |
4 | 3102232001132 |
5 | 103120120000 |
6 | 5251542542 |
7 | 1240343630 |
oct | 322560136 |
9 | 124842278 |
10 | 55238750 |
11 | 291a9766 |
12 | 165baa52 |
13 | b5a0a68 |
14 | 749ca50 |
15 | 4cb2085 |
hex | 34ae05e |
55238750 has 80 divisors (see below), whose sum is σ = 121461120. Its totient is φ = 18444000.
The previous prime is 55238749. The next prime is 55238761. The reversal of 55238750 is 5783255.
55238750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 55238750.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 516197 + ... + 516303.
It is an arithmetic number, because the mean of its divisors is an integer number (1518264).
Almost surely, 255238750 is an apocalyptic number.
55238750 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
55238750 is an abundant number, since it is smaller than the sum of its proper divisors (66222370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55238750 is a wasteful number, since it uses less digits than its factorization.
55238750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195 (or 180 counting only the distinct ones).
The product of its (nonzero) digits is 42000, while the sum is 35.
The square root of 55238750 is about 7432.2775782394. The cubic root of 55238750 is about 380.8447274555.
The spelling of 55238750 in words is "fifty-five million, two hundred thirty-eight thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •