Base | Representation |
---|---|
bin | 11011010001101… |
… | …11100000111000 |
3 | 120221120002211221 |
4 | 31220313200320 |
5 | 432034120302 |
6 | 34412201424 |
7 | 5445624550 |
oct | 1550674070 |
9 | 527502757 |
10 | 228816952 |
11 | 108185621 |
12 | 64769274 |
13 | 38536960 |
14 | 22564160 |
15 | 1514c937 |
hex | da37838 |
228816952 has 64 divisors (see below), whose sum is σ = 545126400. Its totient is φ = 87592320.
The previous prime is 228816947. The next prime is 228816961. The reversal of 228816952 is 259618822.
228816952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 228816899 and 228816908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17499 + ... + 27637.
It is an arithmetic number, because the mean of its divisors is an integer number (8517600).
Almost surely, 2228816952 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 228816952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (272563200).
228816952 is an abundant number, since it is smaller than the sum of its proper divisors (316309448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
228816952 is a wasteful number, since it uses less digits than its factorization.
228816952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10196 (or 10192 counting only the distinct ones).
The product of its digits is 138240, while the sum is 43.
The square root of 228816952 is about 15126.6966651678. The cubic root of 228816952 is about 611.6402616218.
The spelling of 228816952 in words is "two hundred twenty-eight million, eight hundred sixteen thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •