Base | Representation |
---|---|
bin | 1101001000101… |
… | …1001010000000 |
3 | 10211200011102020 |
4 | 3102023022000 |
5 | 103101032221 |
6 | 5244521440 |
7 | 1236210360 |
oct | 322131200 |
9 | 124604366 |
10 | 55095936 |
11 | 29111435 |
12 | 16550280 |
13 | b550a5c |
14 | 74629a0 |
15 | 4c84ac6 |
hex | 348b280 |
55095936 has 128 divisors (see below), whose sum is σ = 169728000. Its totient is φ = 15510528.
The previous prime is 55095919. The next prime is 55095973. The reversal of 55095936 is 63959055.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 276765 + ... + 276963.
It is an arithmetic number, because the mean of its divisors is an integer number (1326000).
Almost surely, 255095936 is an apocalyptic number.
55095936 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55095936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84864000).
55095936 is an abundant number, since it is smaller than the sum of its proper divisors (114632064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55095936 is a wasteful number, since it uses less digits than its factorization.
55095936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326 (or 314 counting only the distinct ones).
The product of its (nonzero) digits is 182250, while the sum is 42.
The square root of 55095936 is about 7422.6636728334. The cubic root of 55095936 is about 380.5162328177.
The spelling of 55095936 in words is "fifty-five million, ninety-five thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •