Base | Representation |
---|---|
bin | 1100001011110… |
… | …0110111001110 |
3 | 10120011102012022 |
4 | 3002330313032 |
5 | 101040331410 |
6 | 5023210142 |
7 | 1160246561 |
oct | 302746716 |
9 | 116142168 |
10 | 51105230 |
11 | 26936130 |
12 | 15146952 |
13 | a7844a7 |
14 | 6b044d8 |
15 | 4747455 |
hex | 30bcdce |
51105230 has 32 divisors (see below), whose sum is σ = 106259040. Its totient is φ = 17489920.
The previous prime is 51105167. The next prime is 51105239. The reversal of 51105230 is 3250115.
It is a super-2 number, since 2×511052302 = 5223489066705800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 51105199 and 51105208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51105239) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11795 + ... + 15534.
It is an arithmetic number, because the mean of its divisors is an integer number (3320595).
Almost surely, 251105230 is an apocalyptic number.
51105230 is an abundant number, since it is smaller than the sum of its proper divisors (55153810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51105230 is a wasteful number, since it uses less digits than its factorization.
51105230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27364.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 51105230 is about 7148.7922056806. The cubic root of 51105230 is about 371.0978592631.
Adding to 51105230 its reverse (3250115), we get a palindrome (54355345).
It can be divided in two parts, 5 and 1105230, that multiplied together give a triangular number (5526150 = T3324).
The spelling of 51105230 in words is "fifty-one million, one hundred five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •