Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …111101001011011001111000 |
3 | 222101001011200222000010210212 |
4 | 231232122323331023121320 |
5 | 202324324111200011300 |
6 | 1551413011312530252 |
7 | 60234101544554660 |
oct | 5556327375133170 |
9 | 871034628003725 |
10 | 201102112110200 |
11 | 59093a21623a64 |
12 | 1a67ab2a550988 |
13 | 8829b038051b2 |
14 | 379357380b1a0 |
15 | 183b1da19a935 |
hex | b6e6bbf4b678 |
201102112110200 has 48 divisors (see below), whose sum is σ = 534357040753680. Its totient is φ = 68949295580160.
The previous prime is 201102112110199. The next prime is 201102112110217. The reversal of 201102112110200 is 2011211201102.
It is a Harshad number since it is a multiple of its sum of digits (14).
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, 71822181497 + ... + 71822184296.
It is an arithmetic number, because the mean of its divisors is an integer number (11132438349035).
Almost surely, 2201102112110200 is an apocalyptic number.
201102112110200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201102112110200 is an abundant number, since it is smaller than the sum of its proper divisors (333254928643480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102112110200 is a wasteful number, since it uses less digits than its factorization.
201102112110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143644365816 (or 143644365807 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201102112110200 its reverse (2011211201102), we get a palindrome (203113323311302).
The spelling of 201102112110200 in words is "two hundred one trillion, one hundred two billion, one hundred twelve million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •