Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010101101101010110101000 |
3 | 222101001011102020010020201101 |
4 | 231232122311111231112220 |
5 | 202324323344240201300 |
6 | 1551412552305331144 |
7 | 60234066026155444 |
oct | 5556326525552650 |
9 | 871034366106641 |
10 | 201102001100200 |
11 | 590939749a2562 |
12 | 1a67aab9336ab4 |
13 | 8829ab68081c5 |
14 | 3793562b91824 |
15 | 183b1d056db6a |
hex | b6e6b556d5a8 |
201102001100200 has 24 divisors (see below), whose sum is σ = 467562152558430. Its totient is φ = 80440800440000.
The previous prime is 201102001100191. The next prime is 201102001100243. The reversal of 201102001100200 is 2001100201102.
It can be written as a sum of positive squares in 3 ways, for example, as 194910135284484 + 6191865815716 = 13961022^2 + 2488346^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, 502755002551 + ... + 502755002950.
Almost surely, 2201102001100200 is an apocalyptic number.
201102001100200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201102001100200 is an abundant number, since it is smaller than the sum of its proper divisors (266460151458230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102001100200 is a wasteful number, since it uses less digits than its factorization.
201102001100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005510005517 (or 1005510005508 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201102001100200 its reverse (2001100201102), we get a palindrome (203103101301302).
The spelling of 201102001100200 in words is "two hundred one trillion, one hundred two billion, one million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •