Base | Representation |
---|---|
bin | 101101101110100011001101… |
… | …101110001101011111111110 |
3 | 222101002000122101100100221110 |
4 | 231232203031232031133332 |
5 | 202330000312012023402 |
6 | 1551421041253342450 |
7 | 60234535030410024 |
oct | 5556431556153776 |
9 | 871060571310843 |
10 | 201111000111102 |
11 | 59097772678654 |
12 | 1a6807ab037a26 |
13 | 882a8bc000223 |
14 | 3793b77dca714 |
15 | 183b55a60256c |
hex | b6e8cdb8d7fe |
201111000111102 has 64 divisors (see below), whose sum is σ = 409210512238080. Its totient is φ = 65882267568000.
The previous prime is 201111000111059. The next prime is 201111000111149.
201111000111102 is nontrivially palindromic in base 10.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 415284327 + ... + 415768317.
It is an arithmetic number, because the mean of its divisors is an integer number (6393914253720).
Almost surely, 2201111000111102 is an apocalyptic number.
201111000111102 is an abundant number, since it is smaller than the sum of its proper divisors (208099512126978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111000111102 is a wasteful number, since it uses less digits than its factorization.
201111000111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489169.
The product of its (nonzero) digits is 4, while the sum is 12.
It can be divided in two parts, 201111000 and 111102, that added together give a palindrome (201222102).
The spelling of 201111000111102 in words is "two hundred one trillion, one hundred eleven billion, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •