Base | Representation |
---|---|
bin | 1100001011110… |
… | …0100111000100 |
3 | 10120011100210000 |
4 | 3002330213010 |
5 | 101040313241 |
6 | 5023201300 |
7 | 1160243553 |
oct | 302744704 |
9 | 116140700 |
10 | 51104196 |
11 | 26935380 |
12 | 15146230 |
13 | a783b90 |
14 | 6b03d9a |
15 | 4746eb6 |
hex | 30bc9c4 |
51104196 has 120 divisors (see below), whose sum is σ = 157094784. Its totient is φ = 14281920.
The previous prime is 51104191. The next prime is 51104197. The reversal of 51104196 is 69140115.
It is a super-2 number, since 2×511041962 = 5223277697612832, which contains 22 as substring.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (51104191) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 45781 + ... + 46883.
Almost surely, 251104196 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 51104196, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78547392).
51104196 is an abundant number, since it is smaller than the sum of its proper divisors (105990588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51104196 is a wasteful number, since it uses less digits than its factorization.
51104196 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1143 (or 1132 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 51104196 is about 7148.7198854061. The cubic root of 51104196 is about 371.0953564679.
The spelling of 51104196 in words is "fifty-one million, one hundred four thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •