Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010010010010000100010000 |
3 | 222101001011102011102121121201 |
4 | 231232122311102102010100 |
5 | 202324323344022431000 |
6 | 1551412552234200544 |
7 | 60234066015425002 |
oct | 5556326522220420 |
9 | 871034364377551 |
10 | 201102000202000 |
11 | 59093974439747 |
12 | 1a67aab8b83154 |
13 | 8829ab6582421 |
14 | 37935629da372 |
15 | 183b1d044296a |
hex | b6e6b5492110 |
201102000202000 has 80 divisors (see below), whose sum is σ = 494506410278400. Its totient is φ = 79077396643200.
The previous prime is 201102000201989. The next prime is 201102000202049. The reversal of 201102000202000 is 202000201102.
It is a tau number, because it is divible by the number of its divisors (80).
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 15 ways as a sum of consecutive naturals, for example, 852009120 + ... + 852245119.
It is an arithmetic number, because the mean of its divisors is an integer number (6181330128480).
Almost surely, 2201102000202000 is an apocalyptic number.
201102000202000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201102000202000 is an abundant number, since it is smaller than the sum of its proper divisors (293404410076400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201102000202000 is a wasteful number, since it uses less digits than its factorization.
201102000202000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1704254321 (or 1704254305 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 201102000202000 its reverse (202000201102), we get a palindrome (201304000403102).
The spelling of 201102000202000 in words is "two hundred one trillion, one hundred two billion, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •