Base | Representation |
---|---|
bin | 1101011101010… |
… | …1011110000000 |
3 | 10221012220022212 |
4 | 3113111132000 |
5 | 103422331041 |
6 | 5333521252 |
7 | 1253544020 |
oct | 327253600 |
9 | 127186285 |
10 | 56448896 |
11 | 29955989 |
12 | 16aa3228 |
13 | b90581a |
14 | 76d5a80 |
15 | 4e508eb |
hex | 35d5780 |
56448896 has 48 divisors (see below), whose sum is σ = 129036120. Its totient is φ = 24096000.
The previous prime is 56448883. The next prime is 56448901. The reversal of 56448896 is 69884465.
It is a happy number.
56448896 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 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 5 ways as a sum of consecutive naturals, for example, 224771 + ... + 225021.
Almost surely, 256448896 is an apocalyptic number.
56448896 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 56448896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64518060).
56448896 is an abundant number, since it is smaller than the sum of its proper divisors (72587224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56448896 is an frugal number, since it uses more digits than its factorization.
56448896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523 (or 260 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 50.
The square root of 56448896 is about 7513.2480326421. The cubic root of 56448896 is about 383.6057875717.
The spelling of 56448896 in words is "fifty-six million, four hundred forty-eight thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •