Base | Representation |
---|---|
bin | 10111001111100101011110… |
… | …11101011011010000101111 |
3 | 20200222100201122122211112212 |
4 | 23213302233131123100233 |
5 | 23144414013431032124 |
6 | 300413002455121035 |
7 | 13523540066115320 |
oct | 1347625735332057 |
9 | 220870648584485 |
10 | 51113054549039 |
11 | 15316a19861a8a |
12 | 589607667317b |
13 | 2269c2bc8ba82 |
14 | c89c5679a447 |
15 | 5d987b73a40e |
hex | 2e7caf75b42f |
51113054549039 has 8 divisors (see below), whose sum is σ = 58415682724128. Its totient is φ = 43810617183840.
The previous prime is 51113054548939. The next prime is 51113054549059. The reversal of 51113054549039 is 93094545031115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51113054549039 - 212 = 51113054544943 is a prime.
It is a super-2 number, since 2×511130545490392 (a number of 28 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 (51113054549059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47127992 + ... + 48200349.
It is an arithmetic number, because the mean of its divisors is an integer number (7301960340516).
Almost surely, 251113054549039 is an apocalyptic number.
51113054549039 is a deficient number, since it is larger than the sum of its proper divisors (7302628175089).
51113054549039 is an equidigital number, since it uses as much as digits as its factorization.
51113054549039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95404945.
The product of its (nonzero) digits is 1458000, while the sum is 50.
The spelling of 51113054549039 in words is "fifty-one trillion, one hundred thirteen billion, fifty-four million, five hundred forty-nine thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •