Base | Representation |
---|---|
bin | 1010000110001110100101… |
… | …1000011110101001110001 |
3 | 1110022100111012111222210210 |
4 | 2201203221120132221301 |
5 | 2423344110404014301 |
6 | 35340123412414333 |
7 | 2224046442315303 |
oct | 241435130365161 |
9 | 43270435458723 |
10 | 11102111001201 |
11 | 35a0419257500 |
12 | 12b37b66173a9 |
13 | 626c033a3b1c |
14 | 2a54b8b07973 |
15 | 143bd0dd0ad6 |
hex | a18e961ea71 |
11102111001201 has 48 divisors (see below), whose sum is σ = 16437999037824. Its totient is φ = 6659484480000.
The previous prime is 11102111001197. The next prime is 11102111001229. The reversal of 11102111001201 is 10210011120111.
It is not a de Polignac number, because 11102111001201 - 22 = 11102111001197 is a prime.
It is a super-3 number, since 3×111021110012013 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (11102111101201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 102272185 + ... + 102380681.
It is an arithmetic number, because the mean of its divisors is an integer number (342458313288).
Almost surely, 211102111001201 is an apocalyptic number.
11102111001201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11102111001201 is a deficient number, since it is larger than the sum of its proper divisors (5335888036623).
11102111001201 is a wasteful number, since it uses less digits than its factorization.
11102111001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111414 (or 111403 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11102111001201 its reverse (10210011120111), we get a palindrome (21312122121312).
The spelling of 11102111001201 in words is "eleven trillion, one hundred two billion, one hundred eleven million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •