Base | Representation |
---|---|
bin | 1101011010010… |
… | …1001010101100 |
3 | 10220211211221022 |
4 | 3112211022230 |
5 | 103400013202 |
6 | 5325353312 |
7 | 1252061144 |
oct | 326451254 |
9 | 126754838 |
10 | 56251052 |
11 | 29830280 |
12 | 16a08838 |
13 | b866760 |
14 | 7683924 |
15 | 4e11ea2 |
hex | 35a52ac |
56251052 has 48 divisors (see below), whose sum is σ = 118390272. Its totient is φ = 23042880.
The previous prime is 56251043. The next prime is 56251067. The reversal of 56251052 is 25015265.
56251052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×562510522 = 6328361702213408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
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 15 ways as a sum of consecutive naturals, for example, 23453 + ... + 25739.
It is an arithmetic number, because the mean of its divisors is an integer number (2466464).
Almost surely, 256251052 is an apocalyptic number.
56251052 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
56251052 is an abundant number, since it is smaller than the sum of its proper divisors (62139220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56251052 is a wasteful number, since it uses less digits than its factorization.
56251052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2358 (or 2356 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 56251052 is about 7500.0701330054. The cubic root of 56251052 is about 383.1571047968.
The spelling of 56251052 in words is "fifty-six million, two hundred fifty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •