Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1001010100000110111011 |
3 | 1102222112201211121220100021 |
4 | 2200031313021110012323 |
5 | 2420341440012010021 |
6 | 35225531344351311 |
7 | 2214306031544110 |
oct | 240156711240673 |
9 | 42875654556307 |
10 | 11010000110011 |
11 | 3565351039641 |
12 | 129998a915537 |
13 | 61b31414c606 |
14 | 2a0c5b726907 |
15 | 1415de589c41 |
hex | a03772541bb |
11010000110011 has 8 divisors (see below), whose sum is σ = 13129938019584. Its totient is φ = 9026832388200.
The previous prime is 11010000109987. The next prime is 11010000110027. The reversal of 11010000110011 is 11001100001011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11010000110011 - 211 = 11010000107963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010000109976 and 11010000110003.
It is not an unprimeable number, because it can be changed into a prime (11010000110051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34192546765 + ... + 34192547086.
It is an arithmetic number, because the mean of its divisors is an integer number (1641242252448).
Almost surely, 211010000110011 is an apocalyptic number.
11010000110011 is a deficient number, since it is larger than the sum of its proper divisors (2119937909573).
11010000110011 is an equidigital number, since it uses as much as digits as its factorization.
11010000110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68385093881.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11010000110011 its reverse (11001100001011), we get a palindrome (22011100111022).
The spelling of 11010000110011 in words is "eleven trillion, ten billion, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •