Base | Representation |
---|---|
bin | 1101011000000… |
… | …0100100000010 |
3 | 10220120020021100 |
4 | 3112000210002 |
5 | 103330213442 |
6 | 5322235230 |
7 | 1250565060 |
oct | 326004402 |
9 | 126506240 |
10 | 56101122 |
11 | 29738670 |
12 | 16955b16 |
13 | b81343c |
14 | 7645030 |
15 | 4dd284c |
hex | 3580902 |
56101122 has 96 divisors (see below), whose sum is σ = 160527744. Its totient is φ = 13708800.
The previous prime is 56101121. The next prime is 56101141. The reversal of 56101122 is 22110165.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 56101095 and 56101104.
It is not an unprimeable number, because it can be changed into a prime (56101121) 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, 22372 + ... + 24752.
It is an arithmetic number, because the mean of its divisors is an integer number (1672164).
Almost surely, 256101122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56101122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80263872).
56101122 is an abundant number, since it is smaller than the sum of its proper divisors (104426622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56101122 is a wasteful number, since it uses less digits than its factorization.
56101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2424 (or 2421 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 56101122 is about 7490.0682239884. The cubic root of 56101122 is about 382.8163831132.
Adding to 56101122 its reverse (22110165), we get a palindrome (78211287).
The spelling of 56101122 in words is "fifty-six million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.251 sec. • engine limits •