Base | Representation |
---|---|
bin | 101111100110011101… |
… | …011000001001111011 |
3 | 11212221000112221201122 |
4 | 233212131120021323 |
5 | 1314133420213201 |
6 | 35251412135455 |
7 | 3456403122263 |
oct | 574635301173 |
9 | 155830487648 |
10 | 51111101051 |
11 | 1a74897a78a |
12 | 9aa500758b |
13 | 4a8700947a |
14 | 268c11c7a3 |
15 | 14e21bee1b |
hex | be675827b |
51111101051 has 4 divisors (see below), whose sum is σ = 52299731352. Its totient is φ = 49922470752.
The previous prime is 51111101047. The next prime is 51111101071. The reversal of 51111101051 is 15010111115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51111101051 - 22 = 51111101047 is a prime.
It is a super-2 number, since 2×511111010512 (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 (51111101071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 594315086 + ... + 594315171.
It is an arithmetic number, because the mean of its divisors is an integer number (13074932838).
Almost surely, 251111101051 is an apocalyptic number.
51111101051 is a deficient number, since it is larger than the sum of its proper divisors (1188630301).
51111101051 is a wasteful number, since it uses less digits than its factorization.
51111101051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188630300.
The product of its (nonzero) digits is 25, while the sum is 17.
Adding to 51111101051 its reverse (15010111115), we get a palindrome (66121212166).
The spelling of 51111101051 in words is "fifty-one billion, one hundred eleven million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •