Base | Representation |
---|---|
bin | 10011111100010100000000 |
3 | 100211121011100 |
4 | 103330110000 |
5 | 2314242101 |
6 | 304014400 |
7 | 62302221 |
oct | 23742400 |
9 | 10747140 |
10 | 5227776 |
11 | 2a50784 |
12 | 1901400 |
13 | 1110678 |
14 | 9a1248 |
15 | 6d3e86 |
hex | 4fc500 |
5227776 has 54 divisors (see below), whose sum is σ = 15079610. Its totient is φ = 1741824.
The previous prime is 5227769. The next prime is 5227777. The reversal of 5227776 is 6777225.
It can be written as a sum of positive squares in only one way, i.e., 3154176 + 2073600 = 1776^2 + 1440^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 5227776.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5227777) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1170 + ... + 3438.
Almost surely, 25227776 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 5227776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7539805).
5227776 is an abundant number, since it is smaller than the sum of its proper divisors (9851834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5227776 is a wasteful number, since it uses less digits than its factorization.
5227776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2291 (or 2274 counting only the distinct ones).
The product of its digits is 41160, while the sum is 36.
The square root of 5227776 is about 2286.4330298524. The cubic root of 5227776 is about 173.5557434241. Note that the first 3 decimals are identical.
The spelling of 5227776 in words is "five million, two hundred twenty-seven thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •