Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1101010101110011101001 |
3 | 1110022100020212021201000000 |
4 | 2201203203331111303221 |
5 | 2423343414110013001 |
6 | 35340110402133213 |
7 | 2224044255655506 |
oct | 241434375256351 |
9 | 43270225251000 |
10 | 11102020001001 |
11 | 35a0381952726 |
12 | 12b3790051209 |
13 | 626bba591857 |
14 | 2a54aa9ba4ad |
15 | 143bc7e07a86 |
hex | a18e3f55ce9 |
11102020001001 has 56 divisors (see below), whose sum is σ = 16760479307400. Its totient is φ = 7350203782656.
The previous prime is 11102020000999. The next prime is 11102020001011. The reversal of 11102020001001 is 10010002020111.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3352282693776 + 7749737307225 = 1830924^2 + 2783835^2 .
It is not a de Polignac number, because 11102020001001 - 21 = 11102020000999 is a prime.
It is a super-3 number, since 3×111020200010013 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11102020001011) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 950753775 + ... + 950765451.
Almost surely, 211102020001001 is an apocalyptic number.
It is an amenable number.
11102020001001 is a deficient number, since it is larger than the sum of its proper divisors (5658459306399).
11102020001001 is an equidigital number, since it uses as much as digits as its factorization.
11102020001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20597 (or 20582 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11102020001001 its reverse (10010002020111), we get a palindrome (21112022021112).
The spelling of 11102020001001 in words is "eleven trillion, one hundred two billion, twenty million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •