Base | Representation |
---|---|
bin | 101111100011000100… |
… | …000001010110111111 |
3 | 11212210001100010202101 |
4 | 233203010001112333 |
5 | 1314024323404211 |
6 | 35242015005531 |
7 | 3455111610664 |
oct | 574304012677 |
9 | 155701303671 |
10 | 51054122431 |
11 | 1a7197a2914 |
12 | 9a89b098a7 |
13 | 4a78279800 |
14 | 2684729a6b |
15 | 14dc1b75c1 |
hex | be31015bf |
51054122431 has 24 divisors (see below), whose sum is σ = 56305791360. Its totient is φ = 46257827616.
The previous prime is 51054122389. The next prime is 51054122443. The reversal of 51054122431 is 13422145015.
It is not a de Polignac number, because 51054122431 - 27 = 51054122303 is a prime.
It is a super-2 number, since 2×510541224312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51054122431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51054122491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7245396 + ... + 7252438.
It is an arithmetic number, because the mean of its divisors is an integer number (2346074640).
Almost surely, 251054122431 is an apocalyptic number.
51054122431 is a deficient number, since it is larger than the sum of its proper divisors (5251668929).
51054122431 is a wasteful number, since it uses less digits than its factorization.
51054122431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7855 (or 7842 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 51054122431 its reverse (13422145015), we get a palindrome (64476267446).
The spelling of 51054122431 in words is "fifty-one billion, fifty-four million, one hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •