Base | Representation |
---|---|
bin | 1010000001000000000100… |
… | …0001100110010110110011 |
3 | 1102222202201001101100000101 |
4 | 2200100001001212112303 |
5 | 2420411204203442121 |
6 | 35230553101133231 |
7 | 2214420250652602 |
oct | 240200101462663 |
9 | 42882631340011 |
10 | 11012313343411 |
11 | 3566328879086 |
12 | 129a31555a217 |
13 | 61b5c2478c83 |
14 | 2a0ddaa3ba39 |
15 | 1416c76c2491 |
hex | a04010665b3 |
11012313343411 has 16 divisors (see below), whose sum is σ = 11166314872608. Its totient is φ = 10858838848000.
The previous prime is 11012313343397. The next prime is 11012313343417. The reversal of 11012313343411 is 11434331321011.
It is a cyclic number.
It is not a de Polignac number, because 11012313343411 - 211 = 11012313341363 is a prime.
It is a super-2 number, since 2×110123133434112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11012313343411.
It is not an unprimeable number, because it can be changed into a prime (11012313343417) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95075145 + ... + 95190901.
It is an arithmetic number, because the mean of its divisors is an integer number (697894679538).
Almost surely, 211012313343411 is an apocalyptic number.
11012313343411 is a deficient number, since it is larger than the sum of its proper divisors (154001529197).
11012313343411 is a wasteful number, since it uses less digits than its factorization.
11012313343411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118022.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 11012313343411 its reverse (11434331321011), we get a palindrome (22446644664422).
The spelling of 11012313343411 in words is "eleven trillion, twelve billion, three hundred thirteen million, three hundred forty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •