Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000011101010010010011 |
3 | 1110122210201221210202111000 |
4 | 2202333233220131102103 |
5 | 2432004122011213021 |
6 | 35453400213153043 |
7 | 2234150136641610 |
oct | 242775750352223 |
9 | 43583657722430 |
10 | 11201000101011 |
11 | 3629354602876 |
12 | 130a9b432b783 |
13 | 6333329b7376 |
14 | 2aa1ba3cd507 |
15 | 14656c82eb26 |
hex | a2fefa1d493 |
11201000101011 has 64 divisors (see below), whose sum is σ = 20080967592960. Its totient is φ = 6023844288000.
The previous prime is 11201000101009. The next prime is 11201000101043. The reversal of 11201000101011 is 11010100010211.
It is not a de Polignac number, because 11201000101011 - 21 = 11201000101009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11201000100984 and 11201000101002.
It is not an unprimeable number, because it can be changed into a prime (11201000101051) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 123658440 + ... + 123748986.
It is an arithmetic number, because the mean of its divisors is an integer number (313765118640).
Almost surely, 211201000101011 is an apocalyptic number.
11201000101011 is a deficient number, since it is larger than the sum of its proper divisors (8879967491949).
11201000101011 is a wasteful number, since it uses less digits than its factorization.
11201000101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129081 (or 129075 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11201000101011 its reverse (11010100010211), we get a palindrome (22211100111222).
The spelling of 11201000101011 in words is "eleven trillion, two hundred one billion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •