Base | Representation |
---|---|
bin | 101111100000001100… |
… | …011111011011011101 |
3 | 11212122200210211102021 |
4 | 233200030133123131 |
5 | 1313430014323401 |
6 | 35233135500141 |
7 | 3453655640503 |
oct | 574014373335 |
9 | 155580724367 |
10 | 51006011101 |
11 | 1a6a4622091 |
12 | 9a75987651 |
13 | 4a6b302c76 |
14 | 267c1a4673 |
15 | 14d7d622a1 |
hex | be031f6dd |
51006011101 has 4 divisors (see below), whose sum is σ = 52764839100. Its totient is φ = 49247183104.
The previous prime is 51006011099. The next prime is 51006011123. The reversal of 51006011101 is 10111060015.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17242316100 + 33763695001 = 131310^2 + 183749^2 .
It is a cyclic number.
It is not a de Polignac number, because 51006011101 - 21 = 51006011099 is a prime.
It is a super-2 number, since 2×510060111012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51006011131) 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, 879413956 + ... + 879414013.
It is an arithmetic number, because the mean of its divisors is an integer number (13191209775).
Almost surely, 251006011101 is an apocalyptic number.
It is an amenable number.
51006011101 is a deficient number, since it is larger than the sum of its proper divisors (1758827999).
51006011101 is a wasteful number, since it uses less digits than its factorization.
51006011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1758827998.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 51006011101 its reverse (10111060015), we get a palindrome (61117071116).
The spelling of 51006011101 in words is "fifty-one billion, six million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •