Base | Representation |
---|---|
bin | 101101101110100010010010… |
… | …110001000101111111010100 |
3 | 222101001221002110011212201101 |
4 | 231232202102301011333110 |
5 | 202324441300304323103 |
6 | 1551420355201435444 |
7 | 60234501360244240 |
oct | 5556422261057724 |
9 | 871057073155641 |
10 | 201110011011028 |
11 | 5909730531a079 |
12 | 1a68057393bb84 |
13 | 882a79210b402 |
14 | 3793ac28b9420 |
15 | 183b4ed875a1d |
hex | b6e892c45fd4 |
201110011011028 has 12 divisors (see below), whose sum is σ = 402220022022112. Its totient is φ = 86190004719000.
The previous prime is 201110011010911. The next prime is 201110011011029. The reversal of 201110011011028 is 820110110011102.
It is a happy number.
201110011011028 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 201110011010996 and 201110011011014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201110011011029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3591250196598 + ... + 3591250196653.
Almost surely, 2201110011011028 is an apocalyptic number.
201110011011028 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
201110011011028 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201110011011028 is a wasteful number, since it uses less digits than its factorization.
201110011011028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7182500393262 (or 7182500393260 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 19.
The spelling of 201110011011028 in words is "two hundred one trillion, one hundred ten billion, eleven million, eleven thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •