Base | Representation |
---|---|
bin | 101111100110000111… |
… | …101001010011101101 |
3 | 11212220121211112000222 |
4 | 233212013221103231 |
5 | 1314130440413031 |
6 | 35251050101125 |
7 | 3456303524231 |
oct | 574607512355 |
9 | 155817745028 |
10 | 51105404141 |
11 | 1a7457395a0 |
12 | 9aa311a7a5 |
13 | 4a85a9340c |
14 | 268b4785c1 |
15 | 14e1946e7b |
hex | be61e94ed |
51105404141 has 8 divisors (see below), whose sum is σ = 55753380000. Its totient is φ = 46457766640.
The previous prime is 51105404099. The next prime is 51105404149. The reversal of 51105404141 is 14140450115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51105404141 is a prime.
It is a super-2 number, since 2×511054041412 (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 51105404141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51105404149) 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, 312155 + ... + 446823.
It is an arithmetic number, because the mean of its divisors is an integer number (6969172500).
Almost surely, 251105404141 is an apocalyptic number.
It is an amenable number.
51105404141 is a deficient number, since it is larger than the sum of its proper divisors (4647975859).
51105404141 is a wasteful number, since it uses less digits than its factorization.
51105404141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169179.
The product of its (nonzero) digits is 1600, while the sum is 26.
Adding to 51105404141 its reverse (14140450115), we get a palindrome (65245854256).
The spelling of 51105404141 in words is "fifty-one billion, one hundred five million, four hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •