Base | Representation |
---|---|
bin | 101111101001101000… |
… | …011100010010110110 |
3 | 11220001201201102120010 |
4 | 233221220130102312 |
5 | 1314241032130423 |
6 | 35300553121050 |
7 | 3460620441204 |
oct | 575150342266 |
9 | 156051642503 |
10 | 51164333238 |
11 | 1a775a28927 |
12 | 9aba9b9186 |
13 | 4a95056ac5 |
14 | 2695218074 |
15 | 14e6bd7693 |
hex | be9a1c4b6 |
51164333238 has 8 divisors (see below), whose sum is σ = 102328666488. Its totient is φ = 17054777744.
The previous prime is 51164333183. The next prime is 51164333239. The reversal of 51164333238 is 83233346115.
It is a sphenic number, since it is the product of 3 distinct primes.
51164333238 is an admirable number.
It is a super-2 number, since 2×511643332382 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51164333196 and 51164333205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51164333239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4263694431 + ... + 4263694442.
It is an arithmetic number, because the mean of its divisors is an integer number (12791083311).
Almost surely, 251164333238 is an apocalyptic number.
51164333238 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51164333238 is a wasteful number, since it uses less digits than its factorization.
51164333238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8527388878.
The product of its digits is 155520, while the sum is 39.
The spelling of 51164333238 in words is "fifty-one billion, one hundred sixty-four million, three hundred thirty-three thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •