Base | Representation |
---|---|
bin | 11010110110100… |
… | …11100000000000 |
3 | 120200212110210001 |
4 | 31123103200000 |
5 | 430131332233 |
6 | 34204045344 |
7 | 5403456160 |
oct | 1533234000 |
9 | 520773701 |
10 | 225261568 |
11 | 106177394 |
12 | 63533854 |
13 | 3789058c |
14 | 21cba5a0 |
15 | 14b9927d |
hex | d6d3800 |
225261568 has 96 divisors (see below), whose sum is σ = 542505600. Its totient is φ = 91348992.
The previous prime is 225261541. The next prime is 225261601. The reversal of 225261568 is 865162522.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 271971 + ... + 272797.
It is an arithmetic number, because the mean of its divisors is an integer number (5651100).
Almost surely, 2225261568 is an apocalyptic number.
225261568 is a gapful number since it is divisible by the number (28) 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 225261568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (271252800).
225261568 is an abundant number, since it is smaller than the sum of its proper divisors (317244032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225261568 is an equidigital number, since it uses as much as digits as its factorization.
225261568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875 (or 855 counting only the distinct ones).
The product of its digits is 57600, while the sum is 37.
The square root of 225261568 is about 15008.7164008119. The cubic root of 225261568 is about 608.4557985676.
The spelling of 225261568 in words is "two hundred twenty-five million, two hundred sixty-one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •