Base | Representation |
---|---|
bin | 101101101110011001111010… |
… | …110111011111100111101110 |
3 | 222101001001212212012022221110 |
4 | 231232121322313133213232 |
5 | 202324314342121213402 |
6 | 1551412311103212450 |
7 | 60234032514622662 |
oct | 5556317267374756 |
9 | 871031785168843 |
10 | 201101020101102 |
11 | 59093511177400 |
12 | 1a67a8848a7126 |
13 | 882998b4c1774 |
14 | 37934ac78c8a2 |
15 | 183b17439256c |
hex | b6e67addf9ee |
201101020101102 has 24 divisors (see below), whose sum is σ = 442089845843688. Its totient is φ = 60939703060720.
The previous prime is 201101020101073. The next prime is 201101020101133.
201101020101102 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×2011010201011022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 138499324413 + ... + 138499325864.
It is an arithmetic number, because the mean of its divisors is an integer number (18420410243487).
Almost surely, 2201101020101102 is an apocalyptic number.
201101020101102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201101020101102 is an abundant number, since it is smaller than the sum of its proper divisors (240988825742586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101020101102 is a wasteful number, since it uses less digits than its factorization.
201101020101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276998650304 (or 276998650293 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
The spelling of 201101020101102 in words is "two hundred one trillion, one hundred one billion, twenty million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •