Base | Representation |
---|---|
bin | 10111001110001000100000… |
… | …00010010001011000111011 |
3 | 20200210120212200121211020101 |
4 | 23213010100002101120323 |
5 | 23143104300103304430 |
6 | 300334025214340231 |
7 | 13520122043552644 |
oct | 1347042002213073 |
9 | 220716780554211 |
10 | 51063135213115 |
11 | 152a7832684063 |
12 | 58884647ba677 |
13 | 2265304b5278c |
14 | c8767ca666cb |
15 | 5d8408ecadca |
hex | 2e711009163b |
51063135213115 has 16 divisors (see below), whose sum is σ = 61684163444736. Its totient is φ = 40578263532000.
The previous prime is 51063135213113. The next prime is 51063135213137. The reversal of 51063135213115 is 51131253136015.
It is not a de Polignac number, because 51063135213115 - 21 = 51063135213113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51063135213113) 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 15 ways as a sum of consecutive naturals, for example, 16638534 + ... + 19467076.
It is an arithmetic number, because the mean of its divisors is an integer number (3855260215296).
Almost surely, 251063135213115 is an apocalyptic number.
51063135213115 is a deficient number, since it is larger than the sum of its proper divisors (10621028231621).
51063135213115 is a wasteful number, since it uses less digits than its factorization.
51063135213115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2852610.
The product of its (nonzero) digits is 40500, while the sum is 37.
The spelling of 51063135213115 in words is "fifty-one trillion, sixty-three billion, one hundred thirty-five million, two hundred thirteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •