Base | Representation |
---|---|
bin | 101111110011100001… |
… | …001100001100010001 |
3 | 11220111021211120001201 |
4 | 233303201030030101 |
5 | 1320111013020213 |
6 | 35325240231201 |
7 | 3465003352534 |
oct | 576341141421 |
9 | 156437746051 |
10 | 51330204433 |
11 | 1a850620362 |
12 | 9b4646b501 |
13 | 4ac0521a41 |
14 | 26ad274a1b |
15 | 150654e6dd |
hex | bf384c311 |
51330204433 has 8 divisors (see below), whose sum is σ = 54034293600. Its totient is φ = 48626365248.
The previous prime is 51330204427. The next prime is 51330204439. The reversal of 51330204433 is 33440203315.
It is an interprime number because it is at equal distance from previous prime (51330204427) and next prime (51330204439).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51330204433 - 29 = 51330203921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51330204439) 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, 479673 + ... + 576841.
It is an arithmetic number, because the mean of its divisors is an integer number (6754286700).
Almost surely, 251330204433 is an apocalyptic number.
It is an amenable number.
51330204433 is a deficient number, since it is larger than the sum of its proper divisors (2704089167).
51330204433 is a wasteful number, since it uses less digits than its factorization.
51330204433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124991.
The product of its (nonzero) digits is 12960, while the sum is 28.
Adding to 51330204433 its reverse (33440203315), we get a palindrome (84770407748).
The spelling of 51330204433 in words is "fifty-one billion, three hundred thirty million, two hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •