Base | Representation |
---|---|
bin | 10100101100011011… |
… | …01101011101001011 |
3 | 1001200021122010012111 |
4 | 22112031231131023 |
5 | 140223142023201 |
6 | 5034240123151 |
7 | 542214246214 |
oct | 122615553513 |
9 | 31607563174 |
10 | 11110111051 |
11 | 4791405966 |
12 | 21a09064b7 |
13 | 108099b410 |
14 | 77577440b |
15 | 45058eb51 |
hex | 29636d74b |
11110111051 has 8 divisors (see below), whose sum is σ = 12143314064. Its totient is φ = 10102419360.
The previous prime is 11110111039. The next prime is 11110111057. The reversal of 11110111051 is 15011101111.
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 11110111051 - 215 = 11110078283 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11110111057) 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 7 ways as a sum of consecutive naturals, for example, 6376920 + ... + 6378661.
It is an arithmetic number, because the mean of its divisors is an integer number (1517914258).
Almost surely, 211110111051 is an apocalyptic number.
11110111051 is a deficient number, since it is larger than the sum of its proper divisors (1033203013).
11110111051 is a wasteful number, since it uses less digits than its factorization.
11110111051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12755661.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 11110111051 its reverse (15011101111), we get a palindrome (26121212162).
The spelling of 11110111051 in words is "eleven billion, one hundred ten million, one hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •