Base | Representation |
---|---|
bin | 1010000000110111111110… |
… | …1011001101011100110001 |
3 | 1102222120002210220022020100 |
4 | 2200031333223031130301 |
5 | 2420342233130311421 |
6 | 35225553455503013 |
7 | 2214312420111045 |
oct | 240157753153461 |
9 | 42876083808210 |
10 | 11010143213361 |
11 | 35654148a0276 |
12 | 1299a0a827a69 |
13 | 61b3379a5356 |
14 | 2a0c72738025 |
15 | 1415ebe05c26 |
hex | a037facd731 |
11010143213361 has 6 divisors (see below), whose sum is σ = 15903540197090. Its totient is φ = 7340095475568.
The previous prime is 11010143213357. The next prime is 11010143213371. The reversal of 11010143213361 is 16331234101011.
11010143213361 is a `hidden beast` number, since 1 + 1 + 0 + 1 + 0 + 1 + 4 + 321 + 336 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 8200027417761 + 2810115795600 = 2863569^2 + 1676340^2 .
It is not a de Polignac number, because 11010143213361 - 22 = 11010143213357 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010143213371) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 611674622956 + ... + 611674622973.
Almost surely, 211010143213361 is an apocalyptic number.
It is an amenable number.
11010143213361 is a deficient number, since it is larger than the sum of its proper divisors (4893396983729).
11010143213361 is a wasteful number, since it uses less digits than its factorization.
11010143213361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1223349245935 (or 1223349245932 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
Adding to 11010143213361 its reverse (16331234101011), we get a palindrome (27341377314372).
The spelling of 11010143213361 in words is "eleven trillion, ten billion, one hundred forty-three million, two hundred thirteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •