Base | Representation |
---|---|
bin | 101111101011111100… |
… | …100100010111111001 |
3 | 11220011102210012212012 |
4 | 233223330210113321 |
5 | 1314331002214031 |
6 | 35304501255305 |
7 | 3461601465320 |
oct | 575374442771 |
9 | 156142705765 |
10 | 51203163641 |
11 | 1a79593a773 |
12 | 9b0ba04535 |
13 | 4aa0101186 |
14 | 269a4450b7 |
15 | 14ea307b2b |
hex | bebf245f9 |
51203163641 has 16 divisors (see below), whose sum is σ = 59402763264. Its totient is φ = 43225033104.
The previous prime is 51203163601. The next prime is 51203163653. The reversal of 51203163641 is 14636130215.
It is a cyclic number.
It is not a de Polignac number, because 51203163641 - 214 = 51203147257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51203163598 and 51203163607.
It is not an unprimeable number, because it can be changed into a prime (51203163601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4310276 + ... + 4322138.
It is an arithmetic number, because the mean of its divisors is an integer number (3712672704).
Almost surely, 251203163641 is an apocalyptic number.
It is an amenable number.
51203163641 is a deficient number, since it is larger than the sum of its proper divisors (8199599623).
51203163641 is a wasteful number, since it uses less digits than its factorization.
51203163641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21140.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 51203163641 its reverse (14636130215), we get a palindrome (65839293856).
The spelling of 51203163641 in words is "fifty-one billion, two hundred three million, one hundred sixty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •