Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …110101111011100010011000 |
3 | 222101001011200211102121111111 |
4 | 231232122323311323202120 |
5 | 202324324110203211300 |
6 | 1551413011204110104 |
7 | 60234101522452423 |
oct | 5556327365734230 |
9 | 871034624377444 |
10 | 201102110210200 |
11 | 59093a20546511 |
12 | 1a67ab29995334 |
13 | 8829b032bb434 |
14 | 37935734749ba |
15 | 183b1d9e229ba |
hex | b6e6bbd7b898 |
201102110210200 has 96 divisors (see below), whose sum is σ = 468573321173760. Its totient is φ = 80267052185600.
The previous prime is 201102110210173. The next prime is 201102110210213. The reversal of 201102110210200 is 2012011201102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 249962982 + ... + 250766218.
It is an arithmetic number, because the mean of its divisors is an integer number (4880972095560).
Almost surely, 2201102110210200 is an apocalyptic number.
201102110210200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201102110210200 is an abundant number, since it is smaller than the sum of its proper divisors (267471210963560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102110210200 is a wasteful number, since it uses less digits than its factorization.
201102110210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805957 (or 805948 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201102110210200 its reverse (2012011201102), we get a palindrome (203114121411302).
The spelling of 201102110210200 in words is "two hundred one trillion, one hundred two billion, one hundred ten million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •