Base | Representation |
---|---|
bin | 101111110010111001… |
… | …110110010101110011 |
3 | 11220110120102121010101 |
4 | 233302321312111303 |
5 | 1320100343010230 |
6 | 35324231213231 |
7 | 3464516610250 |
oct | 576271662563 |
9 | 156416377111 |
10 | 51319891315 |
11 | 1a845816a20 |
12 | 9b42b17217 |
13 | 4abb3507c4 |
14 | 26abb4c427 |
15 | 15056b3aca |
hex | bf2e76573 |
51319891315 has 64 divisors (see below), whose sum is σ = 79354920960. Its totient is φ = 30921264000.
The previous prime is 51319891313. The next prime is 51319891321.
51319891315 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51319891315 - 21 = 51319891313 is a prime.
It is not an unprimeable number, because it can be changed into a prime (51319891313) 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 63 ways as a sum of consecutive naturals, for example, 11825416 + ... + 11829754.
It is an arithmetic number, because the mean of its divisors is an integer number (1239920640).
Almost surely, 251319891315 is an apocalyptic number.
51319891315 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51319891315 is a deficient number, since it is larger than the sum of its proper divisors (28035029645).
51319891315 is a wasteful number, since it uses less digits than its factorization.
51319891315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5384.
The product of its digits is 145800, while the sum is 46.
The spelling of 51319891315 in words is "fifty-one billion, three hundred nineteen million, eight hundred ninety-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.823 sec. • engine limits •