Base | Representation |
---|---|
bin | 101111111101111001… |
… | …001000110001011001 |
3 | 11220221102100012020111 |
4 | 233331321020301121 |
5 | 1320440042112131 |
6 | 35354414524321 |
7 | 3502215636022 |
oct | 577571106131 |
9 | 156842305214 |
10 | 51504254041 |
11 | 1a92a899409 |
12 | 9b948066a1 |
13 | 4b1a5c1386 |
14 | 26c841dc49 |
15 | 151697eab1 |
hex | bfde48c59 |
51504254041 has 4 divisors (see below), whose sum is σ = 51680036772. Its totient is φ = 51328471312.
The previous prime is 51504254033. The next prime is 51504254099. The reversal of 51504254041 is 14045240515.
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 45164750400 + 6339503641 = 212520^2 + 79621^2 .
It is a cyclic number.
It is not a de Polignac number, because 51504254041 - 23 = 51504254033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51504253994 and 51504254012.
It is not an unprimeable number, because it can be changed into a prime (51504254141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87890926 + ... + 87891511.
It is an arithmetic number, because the mean of its divisors is an integer number (12920009193).
Almost surely, 251504254041 is an apocalyptic number.
It is an amenable number.
51504254041 is a deficient number, since it is larger than the sum of its proper divisors (175782731).
51504254041 is a wasteful number, since it uses less digits than its factorization.
51504254041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175782730.
The product of its (nonzero) digits is 16000, while the sum is 31.
Adding to 51504254041 its reverse (14045240515), we get a palindrome (65549494556).
The spelling of 51504254041 in words is "fifty-one billion, five hundred four million, two hundred fifty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •