Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …01010100111110101101 |
3 | 10112201000110012002111100 |
4 | 32210112101110332231 |
5 | 112400223330133401 |
6 | 2043522141113313 |
7 | 132220134164046 |
oct | 16442621247655 |
9 | 3481013162440 |
10 | 1001101021101 |
11 | 356623478395 |
12 | 14202a858839 |
13 | 7353241620c |
14 | 3664c76d8cd |
15 | 1b09324eb86 |
hex | e916454fad |
1001101021101 has 12 divisors (see below), whose sum is σ = 1446066747580. Its totient is φ = 667385939520.
The previous prime is 1001101021099. The next prime is 1001101021117. The reversal of 1001101021101 is 1011201011001.
It can be written as a sum of positive squares in 2 ways, for example, as 606258447876 + 394842573225 = 778626^2 + 628365^2 .
It is not a de Polignac number, because 1001101021101 - 21 = 1001101021099 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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001101023101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 790096 + ... + 1620633.
Almost surely, 21001101021101 is an apocalyptic number.
It is an amenable number.
1001101021101 is a deficient number, since it is larger than the sum of its proper divisors (444965726479).
1001101021101 is a wasteful number, since it uses less digits than its factorization.
1001101021101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2456876 (or 2456873 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1001101021101 its reverse (1011201011001), we get a palindrome (2012302032102).
It can be divided in two parts, 100110 and 1021101, that added together give a palindrome (1121211).
The spelling of 1001101021101 in words is "one trillion, one billion, one hundred one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •