Base | Representation |
---|---|
bin | 101111101010001001… |
… | …001010000110110001 |
3 | 11220002022212010222001 |
4 | 233222021022012301 |
5 | 1314300231100424 |
6 | 35301501014001 |
7 | 3461053360642 |
oct | 575211120661 |
9 | 156068763861 |
10 | 51172909489 |
11 | 1a77a856339 |
12 | 9b01854301 |
13 | 4a96a6a600 |
14 | 269640b6c9 |
15 | 14e782d844 |
hex | bea24a1b1 |
51172909489 has 12 divisors (see below), whose sum is σ = 55440008112. Its totient is φ = 47212729200.
The previous prime is 51172909483. The next prime is 51172909559. The reversal of 51172909489 is 98490927115.
It is not a de Polignac number, because 51172909489 - 23 = 51172909481 is a prime.
It is a super-2 number, since 2×511729094892 (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 (51172909481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 264574 + ... + 415144.
It is an arithmetic number, because the mean of its divisors is an integer number (4620000676).
Almost surely, 251172909489 is an apocalyptic number.
It is an amenable number.
51172909489 is a deficient number, since it is larger than the sum of its proper divisors (4267098623).
51172909489 is a wasteful number, since it uses less digits than its factorization.
51172909489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152608 (or 152595 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 55.
The spelling of 51172909489 in words is "fifty-one billion, one hundred seventy-two million, nine hundred nine thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •