Base | Representation |
---|---|
bin | 101111100010110100… |
… | …010010111011000001 |
3 | 11212202202120200221011 |
4 | 233202310102323001 |
5 | 1314022300000230 |
6 | 35241350400521 |
7 | 3455031561301 |
oct | 574264227301 |
9 | 155682520834 |
10 | 51050000065 |
11 | 1a7174376a9 |
12 | 9a88660141 |
13 | 4a7746533c |
14 | 2683d75601 |
15 | 14dbb50e2a |
hex | be2d12ec1 |
51050000065 has 8 divisors (see below), whose sum is σ = 61263336168. Its totient is φ = 40837776000.
The previous prime is 51050000063. The next prime is 51050000069. The reversal of 51050000065 is 56000005015.
51050000065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 24611521 + 51025388544 = 4961^2 + 225888^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51050000065 - 21 = 51050000063 is a prime.
It is a super-2 number, since 2×510500000652 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51050000063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173436 + ... + 363565.
It is an arithmetic number, because the mean of its divisors is an integer number (7657917021).
Almost surely, 251050000065 is an apocalyptic number.
It is an amenable number.
51050000065 is a deficient number, since it is larger than the sum of its proper divisors (10213336103).
51050000065 is a wasteful number, since it uses less digits than its factorization.
51050000065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 556019.
The product of its (nonzero) digits is 750, while the sum is 22.
The spelling of 51050000065 in words is "fifty-one billion, fifty million, sixty-five", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •