Base | Representation |
---|---|
bin | 101111100110001010… |
… | …010101111001001011 |
3 | 11212220200011102201211 |
4 | 233212022111321023 |
5 | 1314131131023201 |
6 | 35251113153551 |
7 | 3456312530212 |
oct | 574612257113 |
9 | 155820142654 |
10 | 51106111051 |
11 | 1a746081716 |
12 | 9aa33bb8b7 |
13 | 4a85c800c8 |
14 | 268b5c0079 |
15 | 14e1a36651 |
hex | be6295e4b |
51106111051 has 8 divisors (see below), whose sum is σ = 51831595008. Its totient is φ = 50380785000.
The previous prime is 51106111013. The next prime is 51106111057. The reversal of 51106111051 is 15011160115.
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-51106111051 is a prime.
It is a super-2 number, since 2×511061110512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51106111057) 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, 713526 + ... + 781876.
It is an arithmetic number, because the mean of its divisors is an integer number (6478949376).
Almost surely, 251106111051 is an apocalyptic number.
51106111051 is a deficient number, since it is larger than the sum of its proper divisors (725483957).
51106111051 is a wasteful number, since it uses less digits than its factorization.
51106111051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78953.
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 51106111051 its reverse (15011160115), we get a palindrome (66117271166).
The spelling of 51106111051 in words is "fifty-one billion, one hundred six million, one hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •