Base | Representation |
---|---|
bin | 1010000110001110100011… |
… | …0010110010011111101001 |
3 | 1110022100110111221000201110 |
4 | 2201203220302302133221 |
5 | 2423344100341333001 |
6 | 35340122420540533 |
7 | 2224046262325122 |
oct | 241435062623751 |
9 | 43270414830643 |
10 | 11102101121001 |
11 | 35a0413719350 |
12 | 12b37b3251749 |
13 | 626c01324957 |
14 | 2a54b7695049 |
15 | 143bd00cd3d6 |
hex | a18e8cb27e9 |
11102101121001 has 16 divisors (see below), whose sum is σ = 16275664355328. Its totient is φ = 6675565453200.
The previous prime is 11102101120969. The next prime is 11102101121039. The reversal of 11102101121001 is 10012110120111.
11102101121001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11102101121001 - 25 = 11102101120969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11102101121081) 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, 1324512765 + ... + 1324521146.
It is an arithmetic number, because the mean of its divisors is an integer number (1017229022208).
Almost surely, 211102101121001 is an apocalyptic number.
11102101121001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11102101121001 is a deficient number, since it is larger than the sum of its proper divisors (5173563234327).
11102101121001 is a wasteful number, since it uses less digits than its factorization.
11102101121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2649034052.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11102101121001 its reverse (10012110120111), we get a palindrome (21114211241112).
The spelling of 11102101121001 in words is "eleven trillion, one hundred two billion, one hundred one million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •