Base | Representation |
---|---|
bin | 110000010100101110… |
… | …001101000110010111 |
3 | 11221221010001010100010 |
4 | 300110232031012113 |
5 | 1322231114423101 |
6 | 35500420051303 |
7 | 3514546316412 |
oct | 602456150627 |
9 | 157833033303 |
10 | 51887264151 |
11 | 2000700a598 |
12 | a080b33b33 |
13 | 4b7ba64688 |
14 | 2723240b79 |
15 | 153a3d92d6 |
hex | c14b8d197 |
51887264151 has 8 divisors (see below), whose sum is σ = 69184472704. Its totient is φ = 34590782520.
The previous prime is 51887264131. The next prime is 51887264171. The reversal of 51887264151 is 15146278815.
It is an interprime number because it is at equal distance from previous prime (51887264131) and next prime (51887264171).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51887264151 - 29 = 51887263639 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51887264151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51887264131) 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 7 ways as a sum of consecutive naturals, for example, 15360 + ... + 322506.
It is an arithmetic number, because the mean of its divisors is an integer number (8648059088).
Almost surely, 251887264151 is an apocalyptic number.
51887264151 is a deficient number, since it is larger than the sum of its proper divisors (17297208553).
51887264151 is a wasteful number, since it uses less digits than its factorization.
51887264151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363461.
The product of its digits is 537600, while the sum is 48.
The spelling of 51887264151 in words is "fifty-one billion, eight hundred eighty-seven million, two hundred sixty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •