Base | Representation |
---|---|
bin | 110000000000101000… |
… | …000010101100001011 |
3 | 11221001121121122000101 |
4 | 300000220002230023 |
5 | 1321033311314311 |
6 | 35403133350231 |
7 | 3503313441235 |
oct | 600050025413 |
9 | 157047548011 |
10 | 51550104331 |
11 | 1a953765410 |
12 | 9ba8038377 |
13 | 4b26c55a1b |
14 | 26d0557255 |
15 | 151a9d9ec1 |
hex | c00a02b0b |
51550104331 has 24 divisors (see below), whose sum is σ = 57860792640. Its totient is φ = 45547207200.
The previous prime is 51550104323. The next prime is 51550104341. The reversal of 51550104331 is 13340105515.
It is not a de Polignac number, because 51550104331 - 23 = 51550104323 is a prime.
It is a super-2 number, since 2×515501043312 (a number of 22 digits) contains 22 as substring.
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 51550104331.
It is not an unprimeable number, because it can be changed into a prime (51550104311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23656600 + ... + 23658778.
It is an arithmetic number, because the mean of its divisors is an integer number (2410866360).
Almost surely, 251550104331 is an apocalyptic number.
51550104331 is a deficient number, since it is larger than the sum of its proper divisors (6310688309).
51550104331 is a wasteful number, since it uses less digits than its factorization.
51550104331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3835 (or 3798 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 51550104331 its reverse (13340105515), we get a palindrome (64890209846).
The spelling of 51550104331 in words is "fifty-one billion, five hundred fifty million, one hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •