Base | Representation |
---|---|
bin | 101111100010011110… |
… | …100110100000101011 |
3 | 11212202100212202220222 |
4 | 233202132212200223 |
5 | 1314014321010011 |
6 | 35241024440255 |
7 | 3454632334310 |
oct | 574236464053 |
9 | 155670782828 |
10 | 51044313131 |
11 | 1a714202a59 |
12 | 9a8677908b |
13 | 4a762239a6 |
14 | 26832d4d07 |
15 | 14db3caddb |
hex | be27a682b |
51044313131 has 8 divisors (see below), whose sum is σ = 58430911200. Its totient is φ = 43681353408.
The previous prime is 51044313113. The next prime is 51044313161. The reversal of 51044313131 is 13131344015.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 51044313131 - 234 = 33864443947 is a prime.
It is a super-2 number, since 2×510443131312 (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 51044313131.
It is not an unprimeable number, because it can be changed into a prime (51044313161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5904956 + ... + 5913593.
It is an arithmetic number, because the mean of its divisors is an integer number (7303863900).
Almost surely, 251044313131 is an apocalyptic number.
51044313131 is a deficient number, since it is larger than the sum of its proper divisors (7386598069).
51044313131 is a wasteful number, since it uses less digits than its factorization.
51044313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11819173.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 51044313131 its reverse (13131344015), we get a palindrome (64175657146).
The spelling of 51044313131 in words is "fifty-one billion, forty-four million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •