Base | Representation |
---|---|
bin | 10100100011011011… |
… | …10111100010010111 |
3 | 1001111000122112210011 |
4 | 22101231313202113 |
5 | 140044332423441 |
6 | 5022542541051 |
7 | 540310006312 |
oct | 122155674227 |
9 | 31430575704 |
10 | 11034654871 |
11 | 4752858589 |
12 | 217b597787 |
13 | 106b16c2a6 |
14 | 769731979 |
15 | 448b37581 |
hex | 291b77897 |
11034654871 has 12 divisors (see below), whose sum is σ = 11680679712. Its totient is φ = 10422748224.
The previous prime is 11034654793. The next prime is 11034654887. The reversal of 11034654871 is 17845643011.
It is not a de Polignac number, because 11034654871 - 233 = 2444720279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11034651871) 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 11 ways as a sum of consecutive naturals, for example, 76306 + ... + 167008.
It is an arithmetic number, because the mean of its divisors is an integer number (973389976).
Almost surely, 211034654871 is an apocalyptic number.
11034654871 is a deficient number, since it is larger than the sum of its proper divisors (646024841).
11034654871 is an equidigital number, since it uses as much as digits as its factorization.
11034654871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91078 (or 91059 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 40.
The spelling of 11034654871 in words is "eleven billion, thirty-four million, six hundred fifty-four thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •