Base | Representation |
---|---|
bin | 11010111111000… |
… | …10001000000000 |
3 | 120202221210022212 |
4 | 31133202020000 |
5 | 430422320143 |
6 | 34243521252 |
7 | 5416053662 |
oct | 1537421000 |
9 | 522853285 |
10 | 226370048 |
11 | 106864193 |
12 | 63989228 |
13 | 37b8ac98 |
14 | 220c8532 |
15 | 14d17918 |
hex | d7e2200 |
226370048 has 80 divisors (see below), whose sum is σ = 483183360. Its totient is φ = 105701376.
The previous prime is 226370021. The next prime is 226370059. The reversal of 226370048 is 840073622.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 226369996 and 226370023.
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, 553268 + ... + 553676.
It is an arithmetic number, because the mean of its divisors is an integer number (6039792).
Almost surely, 2226370048 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 226370048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241591680).
226370048 is an abundant number, since it is smaller than the sum of its proper divisors (256813312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226370048 is an equidigital number, since it uses as much as digits as its factorization.
226370048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497 (or 481 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 32.
The square root of 226370048 is about 15045.5989578348. The cubic root of 226370048 is about 609.4522073133.
The spelling of 226370048 in words is "two hundred twenty-six million, three hundred seventy thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •