Base | Representation |
---|---|
bin | 1101011001011… |
… | …1001100111100 |
3 | 10220201221110210 |
4 | 3112113030330 |
5 | 103341200402 |
6 | 5324232420 |
7 | 1251432321 |
oct | 326271474 |
9 | 126657423 |
10 | 56193852 |
11 | 297a1300 |
12 | 1699b710 |
13 | b846700 |
14 | 766ab48 |
15 | 4e0006c |
hex | 359733c |
56193852 has 108 divisors (see below), whose sum is σ = 156743160. Its totient is φ = 15649920.
The previous prime is 56193827. The next prime is 56193859. The reversal of 56193852 is 25839165.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 56193852.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56193859) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 245274 + ... + 245502.
Almost surely, 256193852 is an apocalyptic number.
56193852 is a gapful number since it is divisible by the number (52) 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 56193852, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78371580).
56193852 is an abundant number, since it is smaller than the sum of its proper divisors (100549308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56193852 is a wasteful number, since it uses less digits than its factorization.
56193852 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284 (or 258 counting only the distinct ones).
The product of its digits is 64800, while the sum is 39.
The square root of 56193852 is about 7496.2558654304. The cubic root of 56193852 is about 383.0271871118.
The spelling of 56193852 in words is "fifty-six million, one hundred ninety-three thousand, eight hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •