Base | Representation |
---|---|
bin | 1010000001000000001010… |
… | …0111010010011010111001 |
3 | 1102222202202220112122120210 |
4 | 2200100002213102122321 |
5 | 2420411233020003231 |
6 | 35230555452341333 |
7 | 2214421023356103 |
oct | 240200247223271 |
9 | 42882686478523 |
10 | 11012340000441 |
11 | 356634192598a |
12 | 129a322474849 |
13 | 61b5c7b50470 |
14 | 2a10003ba573 |
15 | 1416c9bdaa46 |
hex | a04029d26b9 |
11012340000441 has 64 divisors (see below), whose sum is σ = 15961816765440. Its totient is φ = 6713207838720.
The previous prime is 11012340000439. The next prime is 11012340000443. The reversal of 11012340000441 is 14400004321011.
It is an interprime number because it is at equal distance from previous prime (11012340000439) and next prime (11012340000443).
It is not a de Polignac number, because 11012340000441 - 21 = 11012340000439 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11012340000443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2873032261 + ... + 2873036093.
It is an arithmetic number, because the mean of its divisors is an integer number (249403386960).
Almost surely, 211012340000441 is an apocalyptic number.
It is an amenable number.
11012340000441 is a deficient number, since it is larger than the sum of its proper divisors (4949476764999).
11012340000441 is a wasteful number, since it uses less digits than its factorization.
11012340000441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5506.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 11012340000441 its reverse (14400004321011), we get a palindrome (25412344321452).
The spelling of 11012340000441 in words is "eleven trillion, twelve billion, three hundred forty million, four hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •