Base | Representation |
---|---|
bin | 10111001111001101010110… |
… | …10101111000100011010111 |
3 | 20200221010021212110001210012 |
4 | 23213212223111320203113 |
5 | 23144211001220423421 |
6 | 300403021230150435 |
7 | 13522601062045550 |
oct | 1347465325704327 |
9 | 220833255401705 |
10 | 51100100561111 |
11 | 15311481654138 |
12 | 589366035241b |
13 | 22689462aa264 |
14 | c893881ab327 |
15 | 5d936e37695b |
hex | 2e79ab5788d7 |
51100100561111 has 32 divisors (see below), whose sum is σ = 63305702596608. Its totient is φ = 40286015003520.
The previous prime is 51100100561087. The next prime is 51100100561177. The reversal of 51100100561111 is 11116500100115.
It is a cyclic number.
It is not a de Polignac number, because 51100100561111 - 242 = 46702054050007 is a prime.
It is a super-2 number, since 2×511001005611112 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51100100561311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31822940 + ... + 33390113.
It is an arithmetic number, because the mean of its divisors is an integer number (1978303206144).
Almost surely, 251100100561111 is an apocalyptic number.
51100100561111 is a deficient number, since it is larger than the sum of its proper divisors (12205602035497).
51100100561111 is a wasteful number, since it uses less digits than its factorization.
51100100561111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65213271.
The product of its (nonzero) digits is 150, while the sum is 23.
Adding to 51100100561111 its reverse (11116500100115), we get a palindrome (62216600661226).
The spelling of 51100100561111 in words is "fifty-one trillion, one hundred billion, one hundred million, five hundred sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •