Base | Representation |
---|---|
bin | 1101011001111… |
… | …0110101011000 |
3 | 10220210112100120 |
4 | 3112132311120 |
5 | 103343200422 |
6 | 5325033240 |
7 | 1251622416 |
oct | 326366530 |
9 | 126715316 |
10 | 56225112 |
11 | 29812839 |
12 | 169b5820 |
13 | b8579c8 |
14 | 76782b6 |
15 | 4e0945c |
hex | 359ed58 |
56225112 has 48 divisors (see below), whose sum is σ = 143198040. Its totient is φ = 18396672.
The previous prime is 56225101. The next prime is 56225119. The reversal of 56225112 is 21152265.
It is a happy number.
It is a super-2 number, since 2×562251122 = 6322526438825088, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56225119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83208 + ... + 83880.
Almost surely, 256225112 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 56225112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71599020).
56225112 is an abundant number, since it is smaller than the sum of its proper divisors (86972928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56225112 is a wasteful number, since it uses less digits than its factorization.
56225112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 800 (or 737 counting only the distinct ones).
The product of its digits is 1200, while the sum is 24.
The square root of 56225112 is about 7498.3406164297. The cubic root of 56225112 is about 383.0981985000.
Adding to 56225112 its reverse (21152265), we get a palindrome (77377377).
The spelling of 56225112 in words is "fifty-six million, two hundred twenty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •