Base | Representation |
---|---|
bin | 10111010011111001110100… |
… | …01100100110111110001011 |
3 | 20201111112122212121112112212 |
4 | 23221330322030212332023 |
5 | 23204331332212433033 |
6 | 301005100034055335 |
7 | 13540341360505166 |
oct | 1351747214467613 |
9 | 221445585545485 |
10 | 51261411061643 |
11 | 1537392a186792 |
12 | 58ba97aa1a54b |
13 | 227ac12bba483 |
14 | c930cbb76add |
15 | 5dd660dca748 |
hex | 2e9f3a326f8b |
51261411061643 has 8 divisors (see below), whose sum is σ = 51407265778848. Its totient is φ = 51115559951104.
The previous prime is 51261411061631. The next prime is 51261411061681. The reversal of 51261411061643 is 34616011416215.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51261411061643 - 232 = 51257116094347 is a prime.
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 51261411061643.
It is not an unprimeable number, because it can be changed into a prime (51261411061613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28970321 + ... + 30688797.
It is an arithmetic number, because the mean of its divisors is an integer number (6425908222356).
Almost surely, 251261411061643 is an apocalyptic number.
51261411061643 is a deficient number, since it is larger than the sum of its proper divisors (145854717205).
51261411061643 is a wasteful number, since it uses less digits than its factorization.
51261411061643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1803333.
The product of its (nonzero) digits is 103680, while the sum is 41.
Adding to 51261411061643 its reverse (34616011416215), we get a palindrome (85877422477858).
The spelling of 51261411061643 in words is "fifty-one trillion, two hundred sixty-one billion, four hundred eleven million, sixty-one thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •