Base | Representation |
---|---|
bin | 1010000001100000011110… |
… | …0000011000100001100111 |
3 | 1110000121011021110102211011 |
4 | 2200120013200120201213 |
5 | 2421032013033323421 |
6 | 35234552155523051 |
7 | 2215145644265044 |
oct | 240300740304147 |
9 | 43017137412734 |
10 | 11021012011111 |
11 | 3569a91a65953 |
12 | 129bb42759487 |
13 | 61c37a682c1b |
14 | 2a15c40141cb |
15 | 141a361ca4e1 |
hex | a0607818867 |
11021012011111 has 16 divisors (see below), whose sum is σ = 11860980411168. Its totient is φ = 10202351385600.
The previous prime is 11021012011109. The next prime is 11021012011129. The reversal of 11021012011111 is 11111021012011.
It is not a de Polignac number, because 11021012011111 - 21 = 11021012011109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021012011091 and 11021012011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021012011181) 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, 36696091 + ... + 36995203.
It is an arithmetic number, because the mean of its divisors is an integer number (741311275698).
Almost surely, 211021012011111 is an apocalyptic number.
11021012011111 is a deficient number, since it is larger than the sum of its proper divisors (839968400057).
11021012011111 is a wasteful number, since it uses less digits than its factorization.
11021012011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334722.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11021012011111 its reverse (11111021012011), we get a palindrome (22132033023122).
It can be divided in two parts, 11021012011 and 111, that multiplied together give a palindrome (1223332333221).
The spelling of 11021012011111 in words is "eleven trillion, twenty-one billion, twelve million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •