Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …000100101100011010011 |
3 | 10220100110100111020021000 |
4 | 100002110120211203103 |
5 | 121023344240213021 |
6 | 2202130300033043 |
7 | 142421420543166 |
oct | 20022430454323 |
9 | 3810410436230 |
10 | 1102001101011 |
11 | 3953a098a888 |
12 | 1596a9b32783 |
13 | 7cbc2549805 |
14 | 3b4a116badd |
15 | 1d9eb4ceb26 |
hex | 100946258d3 |
1102001101011 has 16 divisors (see below), whose sum is σ = 1632612304000. Its totient is φ = 734659264584.
The previous prime is 1102001100973. The next prime is 1102001101037. The reversal of 1102001101011 is 1101011002011.
It is not a de Polignac number, because 1102001101011 - 231 = 1099853617363 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102001100984 and 1102001101002.
It is not an unprimeable number, because it can be changed into a prime (1102001001011) 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, 3203220 + ... + 3530526.
It is an arithmetic number, because the mean of its divisors is an integer number (102038269000).
Almost surely, 21102001101011 is an apocalyptic number.
1102001101011 is a deficient number, since it is larger than the sum of its proper divisors (530611202989).
1102001101011 is a wasteful number, since it uses less digits than its factorization.
1102001101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452015 (or 452009 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1102001101011 its reverse (1101011002011), we get a palindrome (2203012103022).
The spelling of 1102001101011 in words is "one trillion, one hundred two billion, one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •