Base | Representation |
---|---|
bin | 10111001111100000000011… |
… | …11011111011100101000110 |
3 | 20200222002012202122120120022 |
4 | 23213300001323323211012 |
5 | 23144342033141411100 |
6 | 300411401541135142 |
7 | 13523404666025351 |
oct | 1347600173734506 |
9 | 220862182576508 |
10 | 51110143310150 |
11 | 15315765507131 |
12 | 58955a36ba4b2 |
13 | 2269886ab4602 |
14 | c89a5bc9b298 |
15 | 5d975ad7ae85 |
hex | 2e7c01efb946 |
51110143310150 has 12 divisors (see below), whose sum is σ = 95064866556972. Its totient is φ = 20444057324040.
The previous prime is 51110143310147. The next prime is 51110143310159. The reversal of 51110143310150 is 5101334101115.
It is a super-2 number, since 2×511101433101502 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51110143310159) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 511101433052 + ... + 511101433151.
It is an arithmetic number, because the mean of its divisors is an integer number (7922072213081).
Almost surely, 251110143310150 is an apocalyptic number.
51110143310150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51110143310150 is a deficient number, since it is larger than the sum of its proper divisors (43954723246822).
51110143310150 is a wasteful number, since it uses less digits than its factorization.
51110143310150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1022202866215 (or 1022202866210 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 51110143310150 its reverse (5101334101115), we get a palindrome (56211477411265).
The spelling of 51110143310150 in words is "fifty-one trillion, one hundred ten billion, one hundred forty-three million, three hundred ten thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •