Base | Representation |
---|---|
bin | 101111110010100110… |
… | …110001101011001011 |
3 | 11220110020000120121211 |
4 | 233302212301223023 |
5 | 1320043103011332 |
6 | 35323532113551 |
7 | 3464426244400 |
oct | 576246615313 |
9 | 156406016554 |
10 | 51314891467 |
11 | 1a842a11514 |
12 | 9b413058b7 |
13 | 4aba2bcb08 |
14 | 26ab20a2a7 |
15 | 1505027447 |
hex | bf29b1acb |
51314891467 has 12 divisors (see below), whose sum is σ = 61081040856. Its totient is φ = 42961302720.
The previous prime is 51314891443. The next prime is 51314891473. The reversal of 51314891467 is 76419841315.
It is not a de Polignac number, because 51314891467 - 223 = 51306502859 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
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 51314891467.
It is not an unprimeable number, because it can be changed into a prime (51314891417) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12175134 + ... + 12179347.
It is an arithmetic number, because the mean of its divisors is an integer number (5090086738).
Almost surely, 251314891467 is an apocalyptic number.
51314891467 is a deficient number, since it is larger than the sum of its proper divisors (9766149389).
51314891467 is a wasteful number, since it uses less digits than its factorization.
51314891467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24354538 (or 24354531 counting only the distinct ones).
The product of its digits is 725760, while the sum is 49.
The spelling of 51314891467 in words is "fifty-one billion, three hundred fourteen million, eight hundred ninety-one thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •