Base | Representation |
---|---|
bin | 10111001100011100001110… |
… | …10010110101000010110011 |
3 | 20200121000211121012020112112 |
4 | 23212032013102311002303 |
5 | 23141131223131000034 |
6 | 300251213154315535 |
7 | 13512663415626125 |
oct | 1346160722650263 |
9 | 220530747166475 |
10 | 51005006500019 |
11 | 15285113520600 |
12 | 5879141588bab |
13 | 225c99ccb4b60 |
14 | c84926925215 |
15 | 5d6b55bb37ce |
hex | 2e63874b50b3 |
51005006500019 has 48 divisors (see below), whose sum is σ = 60449454024960. Its totient is φ = 42749309433600.
The previous prime is 51005006499929. The next prime is 51005006500037. The reversal of 51005006500019 is 91000560050015.
51005006500019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 51005006500019 - 28 = 51005006499763 is a prime.
It is a super-2 number, since 2×510050065000192 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51005006500039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5477925374 + ... + 5477934684.
It is an arithmetic number, because the mean of its divisors is an integer number (1259363625520).
Almost surely, 251005006500019 is an apocalyptic number.
51005006500019 is a deficient number, since it is larger than the sum of its proper divisors (9444447524941).
51005006500019 is a wasteful number, since it uses less digits than its factorization.
51005006500019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13212 (or 13201 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 32.
The spelling of 51005006500019 in words is "fifty-one trillion, five billion, six million, five hundred thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •