Base | Representation |
---|---|
bin | 1100010010111… |
… | …0010111000000 |
3 | 10121001000220011 |
4 | 3010232113000 |
5 | 101200220422 |
6 | 5041154304 |
7 | 1164224116 |
oct | 304562700 |
9 | 117030804 |
10 | 51570112 |
11 | 27123430 |
12 | 1532b994 |
13 | a8b7c79 |
14 | 6bc5ab6 |
15 | 47da077 |
hex | 312e5c0 |
51570112 has 112 divisors (see below), whose sum is σ = 122895360. Its totient is φ = 21196800.
The previous prime is 51570109. The next prime is 51570137. The reversal of 51570112 is 21107515.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 370939 + ... + 371077.
It is an arithmetic number, because the mean of its divisors is an integer number (1097280).
Almost surely, 251570112 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 51570112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61447680).
51570112 is an abundant number, since it is smaller than the sum of its proper divisors (71325248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51570112 is a wasteful number, since it uses less digits than its factorization.
51570112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 350, while the sum is 22.
The square root of 51570112 is about 7181.2333202591. The cubic root of 51570112 is about 372.2197029540.
Adding to 51570112 its reverse (21107515), we get a palindrome (72677627).
The spelling of 51570112 in words is "fifty-one million, five hundred seventy thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •