Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000000111101110000011 |
3 | 10220011211112020102200100 |
4 | 100000221220013232003 |
5 | 121011212230323021 |
6 | 2201232434453443 |
7 | 142326141535356 |
oct | 20005150075603 |
9 | 3804745212610 |
10 | 1100210011011 |
11 | 394661961411 |
12 | 15928a134283 |
13 | 7c998459147 |
14 | 3b37133429d |
15 | 1d944136626 |
hex | 10029a07b83 |
1100210011011 has 48 divisors (see below), whose sum is σ = 1635713134848. Its totient is φ = 712090958400.
The previous prime is 1100210011003. The next prime is 1100210011037. The reversal of 1100210011011 is 1101100120011.
It is not a de Polignac number, because 1100210011011 - 23 = 1100210011003 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 = 1100210010984 and 1100210011002.
It is not an unprimeable number, because it can be changed into a prime (1100210011001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 464026656 + ... + 464029026.
It is an arithmetic number, because the mean of its divisors is an integer number (34077356976).
Almost surely, 21100210011011 is an apocalyptic number.
1100210011011 is a deficient number, since it is larger than the sum of its proper divisors (535503123837).
1100210011011 is a wasteful number, since it uses less digits than its factorization.
1100210011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4872 (or 4869 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100210011011 its reverse (1101100120011), we get a palindrome (2201310131022).
The spelling of 1100210011011 in words is "one trillion, one hundred billion, two hundred ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •