Base | Representation |
---|---|
bin | 101101101110100011010011… |
… | …101111011101000001000100 |
3 | 222101002000220102101010210201 |
4 | 231232203103233131001010 |
5 | 202330001013340200400 |
6 | 1551421055302100244 |
7 | 60234540364661422 |
oct | 5556432357350104 |
9 | 871060812333721 |
10 | 201111101100100 |
11 | 59097814685134 |
12 | 1a680818a1a684 |
13 | 882a906bcbc29 |
14 | 3793b87598112 |
15 | 183b56440006a |
hex | b6e8d3bdd044 |
201111101100100 has 18 divisors (see below), whose sum is σ = 436411089387434. Its totient is φ = 80444440440000.
The previous prime is 201111101100067. The next prime is 201111101100113. The reversal of 201111101100100 is 1001101111102.
It can be written as a sum of positive squares in 3 ways, for example, as 6733744742916 + 194377356357184 = 2594946^2 + 13941928^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1005555505401 + ... + 1005555505600.
Almost surely, 2201111101100100 is an apocalyptic number.
201111101100100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201111101100100 is an abundant number, since it is smaller than the sum of its proper divisors (235299988287334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111101100100 is a wasteful number, since it uses less digits than its factorization.
201111101100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011111011015 (or 2011111011008 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 201111101100100 its reverse (1001101111102), we get a palindrome (202112202211202).
The spelling of 201111101100100 in words is "two hundred one trillion, one hundred eleven billion, one hundred one million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •