Base | Representation |
---|---|
bin | 101011100110… |
… | …0010101001000 |
3 | 1121000020221202 |
4 | 1113030111020 |
5 | 21322411112 |
6 | 2133523332 |
7 | 365165402 |
oct | 127142510 |
9 | 47006852 |
10 | 22857032 |
11 | 119a1910 |
12 | 77a3548 |
13 | 4973993 |
14 | 306db72 |
15 | 20176c2 |
hex | 15cc548 |
22857032 has 48 divisors (see below), whose sum is σ = 48973680. Its totient is φ = 9917600.
The previous prime is 22856989. The next prime is 22857053. The reversal of 22857032 is 23075822.
It is a junction number, because it is equal to n+sod(n) for n = 22856986 and 22857004.
It is an unprimeable number.
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, 46307 + ... + 46797.
It is an arithmetic number, because the mean of its divisors is an integer number (1020285).
Almost surely, 222857032 is an apocalyptic number.
22857032 is a gapful number since it is divisible by the number (22) 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 22857032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24486840).
22857032 is an abundant number, since it is smaller than the sum of its proper divisors (26116648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22857032 is a wasteful number, since it uses less digits than its factorization.
22857032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554 (or 527 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 22857032 is about 4780.9028436060. The cubic root of 22857032 is about 283.7962235887.
The spelling of 22857032 in words is "twenty-two million, eight hundred fifty-seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •