Base | Representation |
---|---|
bin | 101101101100111101110010… |
… | …110001010011000001110000 |
3 | 222100200121112221121002202002 |
4 | 231230331302301103001300 |
5 | 202321204300100323440 |
6 | 1551255031234313132 |
7 | 60223631263005122 |
oct | 5554756261230160 |
9 | 870617487532662 |
10 | 201002100011120 |
11 | 5905556a384721 |
12 | 1a6636787287a8 |
13 | 882055564a645 |
14 | 378c7a6d1b212 |
15 | 18387d4d71115 |
hex | b6cf72c53070 |
201002100011120 has 80 divisors (see below), whose sum is σ = 476184487679712. Its totient is φ = 78877703224320.
The previous prime is 201002100011113. The next prime is 201002100011159. The reversal of 201002100011120 is 21110001200102.
201002100011120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
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, 52827875 + ... + 56504765.
Almost surely, 2201002100011120 is an apocalyptic number.
201002100011120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201002100011120 is an abundant number, since it is smaller than the sum of its proper divisors (275182387668592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201002100011120 is a wasteful number, since it uses less digits than its factorization.
201002100011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3689850 (or 3689844 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201002100011120 its reverse (21110001200102), we get a palindrome (222112101211222).
The spelling of 201002100011120 in words is "two hundred one trillion, two billion, one hundred million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •