Base | Representation |
---|---|
bin | 1101011101010… |
… | …1100010000000 |
3 | 10221012220200100 |
4 | 3113111202000 |
5 | 103422333102 |
6 | 5333522400 |
7 | 1253544534 |
oct | 327254200 |
9 | 127186610 |
10 | 56449152 |
11 | 299560a1 |
12 | 16aa3400 |
13 | b905986 |
14 | 76d5bc4 |
15 | 4e50a1c |
hex | 35d5880 |
56449152 has 96 divisors (see below), whose sum is σ = 171054000. Its totient is φ = 17819136.
The previous prime is 56449123. The next prime is 56449157. The reversal of 56449152 is 25194465.
56449152 is a `hidden beast` number, since 5 + 644 + 9 + 1 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (56449157) 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 11 ways as a sum of consecutive naturals, for example, 20599 + ... + 23177.
Almost surely, 256449152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56449152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85527000).
56449152 is an abundant number, since it is smaller than the sum of its proper divisors (114604848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56449152 is a wasteful number, since it uses less digits than its factorization.
56449152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2618 (or 2603 counting only the distinct ones).
The product of its digits is 43200, while the sum is 36.
The square root of 56449152 is about 7513.2650691959. The cubic root of 56449152 is about 383.6063674645.
The spelling of 56449152 in words is "fifty-six million, four hundred forty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •