Base | Representation |
---|---|
bin | 1101011100010… |
… | …1001000000000 |
3 | 10221002111111110 |
4 | 3113011020000 |
5 | 103413210302 |
6 | 5332243320 |
7 | 1253144604 |
oct | 327051000 |
9 | 127074443 |
10 | 56381952 |
11 | 2990a660 |
12 | 16a70540 |
13 | b8b1203 |
14 | 76b9504 |
15 | 4e3ab6c |
hex | 35c5200 |
56381952 has 160 divisors (see below), whose sum is σ = 169703424. Its totient is φ = 16486400.
The previous prime is 56381951. The next prime is 56381971. The reversal of 56381952 is 25918365.
It is a super-2 number, since 2×563819522 = 6357849022660608, which contains 22 as substring.
Its product of digits (64800) is a multiple of the sum of its prime factors (150).
It is a self number, because there is not a number n which added to its sum of digits gives 56381952.
It is not an unprimeable number, because it can be changed into a prime (56381951) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 794077 + ... + 794147.
Almost surely, 256381952 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 56381952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84851712).
56381952 is an abundant number, since it is smaller than the sum of its proper divisors (113321472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56381952 is a wasteful number, since it uses less digits than its factorization.
56381952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150 (or 134 counting only the distinct ones).
The product of its digits is 64800, while the sum is 39.
The square root of 56381952 is about 7508.7916471294. The cubic root of 56381952 is about 383.4540853779.
The spelling of 56381952 in words is "fifty-six million, three hundred eighty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •