Base | Representation |
---|---|
bin | 10111001111011001001000… |
… | …00001110111001101011011 |
3 | 20200221201121022012020112101 |
4 | 23213230210001313031123 |
5 | 23144311422100320123 |
6 | 300405544304424231 |
7 | 13523213511122032 |
oct | 1347544401671533 |
9 | 220851538166471 |
10 | 51106420323163 |
11 | 15314124a26987 |
12 | 5894924918077 |
13 | 22694126a2b2a |
14 | c897c7655719 |
15 | 5d95de0c3aad |
hex | 2e7b2407735b |
51106420323163 has 8 divisors (see below), whose sum is σ = 53078664928256. Its totient is φ = 49154403868200.
The previous prime is 51106420323071. The next prime is 51106420323197. The reversal of 51106420323163 is 36132302460115.
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 51106420323163 - 221 = 51106418226011 is a prime.
It is a super-2 number, since 2×511064203231632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51106420324163) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5057032383 + ... + 5057042488.
It is an arithmetic number, because the mean of its divisors is an integer number (6634833116032).
Almost surely, 251106420323163 is an apocalyptic number.
51106420323163 is a deficient number, since it is larger than the sum of its proper divisors (1972244605093).
51106420323163 is a wasteful number, since it uses less digits than its factorization.
51106420323163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10114075065.
The product of its (nonzero) digits is 77760, while the sum is 37.
Adding to 51106420323163 its reverse (36132302460115), we get a palindrome (87238722783278).
The spelling of 51106420323163 in words is "fifty-one trillion, one hundred six billion, four hundred twenty million, three hundred twenty-three thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •