Base | Representation |
---|---|
bin | 1010000001011110010101… |
… | …1011111001110100011110 |
3 | 1110000112200102220011110022 |
4 | 2200113211123321310132 |
5 | 2421024330221131142 |
6 | 35234415340312142 |
7 | 2215125533622461 |
oct | 240274533716436 |
9 | 43015612804408 |
10 | 11020440411422 |
11 | 3569819345612 |
12 | 129ba03242652 |
13 | 61c2b911c160 |
14 | 2a156c1412d8 |
15 | 141a00e1c6d2 |
hex | a05e56f9d1e |
11020440411422 has 8 divisors (see below), whose sum is σ = 17802249895416. Its totient is φ = 5086357112952.
The previous prime is 11020440411401. The next prime is 11020440411433. The reversal of 11020440411422 is 22411404402011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 423863092747 = 11020440411422 / (1 + 1 + 0 + 2 + 0 + 4 + 4 + 0 + 4 + 1 + 1 + 4 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11020440411391 and 11020440411400.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211931546348 + ... + 211931546399.
It is an arithmetic number, because the mean of its divisors is an integer number (2225281236927).
Almost surely, 211020440411422 is an apocalyptic number.
11020440411422 is a deficient number, since it is larger than the sum of its proper divisors (6781809483994).
11020440411422 is a wasteful number, since it uses less digits than its factorization.
11020440411422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423863092762.
The product of its (nonzero) digits is 2048, while the sum is 26.
Adding to 11020440411422 its reverse (22411404402011), we get a palindrome (33431844813433).
The spelling of 11020440411422 in words is "eleven trillion, twenty billion, four hundred forty million, four hundred eleven thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •