Base | Representation |
---|---|
bin | 101101101110011010000000… |
… | …001110011110100011000100 |
3 | 222101001002010010101021122102 |
4 | 231232122000032132203010 |
5 | 202324320033130341400 |
6 | 1551412324034251232 |
7 | 60234034656065114 |
oct | 5556320016364304 |
9 | 871032103337572 |
10 | 201101110012100 |
11 | 590935579a7911 |
12 | 1a67a8aaa26b18 |
13 | 88299a401203c |
14 | 37934ba6b5044 |
15 | 183b17c2029d5 |
hex | b6e68039e8c4 |
201101110012100 has 72 divisors (see below), whose sum is σ = 451592524744200. Its totient is φ = 77639933593600.
The previous prime is 201101110012087. The next prime is 201101110012207. The reversal of 201101110012100 is 1210011101102.
It can be written as a sum of positive squares in 12 ways, for example, as 58692974165956 + 142408135846144 = 7661134^2 + 11933488^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3482981 + ... + 20355180.
It is an arithmetic number, because the mean of its divisors is an integer number (6272118399225).
Almost surely, 2201101110012100 is an apocalyptic number.
201101110012100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201101110012100 is an abundant number, since it is smaller than the sum of its proper divisors (250491414732100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101110012100 is a wasteful number, since it uses less digits than its factorization.
201101110012100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23841113 (or 23841106 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201101110012100 its reverse (1210011101102), we get a palindrome (202311121113202).
The spelling of 201101110012100 in words is "two hundred one trillion, one hundred one billion, one hundred ten million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •