Base | Representation |
---|---|
bin | 101111110011100001… |
… | …100100110011010001 |
3 | 11220111022000200100001 |
4 | 233303201210303101 |
5 | 1320111024231413 |
6 | 35325242330001 |
7 | 3465004252444 |
oct | 576341446321 |
9 | 156438020301 |
10 | 51330305233 |
11 | 1a85068a069 |
12 | 9b464b9901 |
13 | 4ac055889c |
14 | 26ad29d65b |
15 | 150656e4dd |
hex | bf3864cd1 |
51330305233 has 4 divisors (see below), whose sum is σ = 51332001700. Its totient is φ = 51328608768.
The previous prime is 51330305219. The next prime is 51330305237. The reversal of 51330305233 is 33250303315.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2951422929 + 48378882304 = 54327^2 + 219952^2 .
It is a cyclic number.
It is not a de Polignac number, because 51330305233 - 233 = 42740370641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51330305237) 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 3 ways as a sum of consecutive naturals, for example, 802008 + ... + 863641.
It is an arithmetic number, because the mean of its divisors is an integer number (12833000425).
Almost surely, 251330305233 is an apocalyptic number.
It is an amenable number.
51330305233 is a deficient number, since it is larger than the sum of its proper divisors (1696467).
51330305233 is a wasteful number, since it uses less digits than its factorization.
51330305233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1696466.
The product of its (nonzero) digits is 12150, while the sum is 28.
Adding to 51330305233 its reverse (33250303315), we get a palindrome (84580608548).
The spelling of 51330305233 in words is "fifty-one billion, three hundred thirty million, three hundred five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •