Base | Representation |
---|---|
bin | 10111001111011111111111… |
… | …01110000001100000111011 |
3 | 20200222002010011122121120101 |
4 | 23213233333232001200323 |
5 | 23144341444131010021 |
6 | 300411354131540231 |
7 | 13523404034601214 |
oct | 1347577756014073 |
9 | 220862104577511 |
10 | 51110106110011 |
11 | 15315746509113 |
12 | 589559315a677 |
13 | 226987c18b2b0 |
14 | c89a56d7640b |
15 | 5d975797da91 |
hex | 2e7bffb8183b |
51110106110011 has 16 divisors (see below), whose sum is σ = 55090250623744. Its totient is φ = 47136909861504.
The previous prime is 51110106109961. The next prime is 51110106110039. The reversal of 51110106110011 is 11001160101115.
It is a cyclic number.
It is not a de Polignac number, because 51110106110011 - 225 = 51110072555579 is a prime.
It is a super-2 number, since 2×511101061100112 (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 (51110106110081) 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 15 ways as a sum of consecutive naturals, for example, 229734550 + ... + 229956916.
It is an arithmetic number, because the mean of its divisors is an integer number (3443140663984).
Almost surely, 251110106110011 is an apocalyptic number.
51110106110011 is a deficient number, since it is larger than the sum of its proper divisors (3980144513733).
51110106110011 is a wasteful number, since it uses less digits than its factorization.
51110106110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237910.
The product of its (nonzero) digits is 30, while the sum is 19.
Adding to 51110106110011 its reverse (11001160101115), we get a palindrome (62111266211126).
The spelling of 51110106110011 in words is "fifty-one trillion, one hundred ten billion, one hundred six million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •