Base | Representation |
---|---|
bin | 11010111111101… |
… | …10111111011100 |
3 | 120210010010120100 |
4 | 31133312333130 |
5 | 430433034031 |
6 | 34245421100 |
7 | 5416561110 |
oct | 1537667734 |
9 | 523103510 |
10 | 226455516 |
11 | 106912421 |
12 | 63a0a790 |
13 | 37bbab61 |
14 | 2210b740 |
15 | 14d32de6 |
hex | d7f6fdc |
226455516 has 144 divisors (see below), whose sum is σ = 691891200. Its totient is φ = 61053696.
The previous prime is 226455499. The next prime is 226455517. The reversal of 226455516 is 615554622.
226455516 is a `hidden beast` number, since 2 + 2 + 645 + 5 + 5 + 1 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226455517) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 515625 + ... + 516063.
It is an arithmetic number, because the mean of its divisors is an integer number (4804800).
Almost surely, 2226455516 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 226455516, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (345945600).
226455516 is an abundant number, since it is smaller than the sum of its proper divisors (465435684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226455516 is a wasteful number, since it uses less digits than its factorization.
226455516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568 (or 563 counting only the distinct ones).
The product of its digits is 72000, while the sum is 36.
The square root of 226455516 is about 15048.4389888121. The cubic root of 226455516 is about 609.5288990069.
The spelling of 226455516 in words is "two hundred twenty-six million, four hundred fifty-five thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •