Base | Representation |
---|---|
bin | 10100100101101001… |
… | …11000101110110111 |
3 | 1001112022200101200010 |
4 | 22102310320232313 |
5 | 140114114200431 |
6 | 5024445551303 |
7 | 540624155526 |
oct | 122264705667 |
9 | 31468611603 |
10 | 11053271991 |
11 | 4762313933 |
12 | 2185875533 |
13 | 1071c8a138 |
14 | 76bdba4bd |
15 | 44a5b3846 |
hex | 292d38bb7 |
11053271991 has 32 divisors (see below), whose sum is σ = 15585771520. Its totient is φ = 6956863200.
The previous prime is 11053271951. The next prime is 11053272023. The reversal of 11053271991 is 19917235011.
It is not a de Polignac number, because 11053271991 - 210 = 11053270967 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 (11053271941) 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 31 ways as a sum of consecutive naturals, for example, 5881590 + ... + 5883468.
It is an arithmetic number, because the mean of its divisors is an integer number (487055360).
Almost surely, 211053271991 is an apocalyptic number.
11053271991 is a deficient number, since it is larger than the sum of its proper divisors (4532499529).
11053271991 is a wasteful number, since it uses less digits than its factorization.
11053271991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3427.
The product of its (nonzero) digits is 17010, while the sum is 39.
The spelling of 11053271991 in words is "eleven billion, fifty-three million, two hundred seventy-one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •