Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …100011110110101011011 |
3 | 10220021101120222101202000 |
4 | 100001210230132311123 |
5 | 121020224424310021 |
6 | 2201515035212043 |
7 | 142362534100314 |
oct | 20014454366533 |
9 | 3807346871660 |
10 | 1101201010011 |
11 | 395020297653 |
12 | 159505ba7023 |
13 | 7cac586439b |
14 | 3b426bbb60b |
15 | 1d9a113ab26 |
hex | 10064b1ed5b |
1101201010011 has 8 divisors (see below), whose sum is σ = 1631408903760. Its totient is φ = 734134006656.
The previous prime is 1101201010003. The next prime is 1101201010069. The reversal of 1101201010011 is 1100101021011.
It is not a de Polignac number, because 1101201010011 - 23 = 1101201010003 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 = 1101201009975 and 1101201010002.
It is not an unprimeable number, because it can be changed into a prime (1101201010001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20392611270 + ... + 20392611323.
It is an arithmetic number, because the mean of its divisors is an integer number (203926112970).
Almost surely, 21101201010011 is an apocalyptic number.
1101201010011 is a deficient number, since it is larger than the sum of its proper divisors (530207893749).
1101201010011 is an equidigital number, since it uses as much as digits as its factorization.
1101201010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40785222602 (or 40785222596 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1101201010011 its reverse (1100101021011), we get a palindrome (2201302031022).
The spelling of 1101201010011 in words is "one trillion, one hundred one billion, two hundred one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •