Base | Representation |
---|---|
bin | 110000010010101111… |
… | …000001011000000001 |
3 | 11221211210022021000211 |
4 | 300102233001120001 |
5 | 1322144101030331 |
6 | 35453225314121 |
7 | 3513663036346 |
oct | 602257013001 |
9 | 157753267024 |
10 | 51853923841 |
11 | 1aa9a208515 |
12 | a071935941 |
13 | 4b74b90195 |
14 | 271ca427cd |
15 | 15375008b1 |
hex | c12bc1601 |
51853923841 has 4 divisors (see below), whose sum is σ = 51860060884. Its totient is φ = 51847786800.
The previous prime is 51853923817. The next prime is 51853923881. The reversal of 51853923841 is 14832935815.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14832935815 = 5 ⋅2966587163.
It can be written as a sum of positive squares in 2 ways, for example, as 17082490000 + 34771433841 = 130700^2 + 186471^2 .
It is a cyclic number.
It is not a de Polignac number, because 51853923841 - 211 = 51853921793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51853923811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3055830 + ... + 3072751.
It is an arithmetic number, because the mean of its divisors is an integer number (12965015221).
Almost surely, 251853923841 is an apocalyptic number.
It is an amenable number.
51853923841 is a deficient number, since it is larger than the sum of its proper divisors (6137043).
51853923841 is an equidigital number, since it uses as much as digits as its factorization.
51853923841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6137042.
The product of its digits is 1036800, while the sum is 49.
The spelling of 51853923841 in words is "fifty-one billion, eight hundred fifty-three million, nine hundred twenty-three thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •