Base | Representation |
---|---|
bin | 101101101110101011100110… |
… | …010010001001110100111100 |
3 | 222101002212212202012212001012 |
4 | 231232223212102021310330 |
5 | 202330122231020333040 |
6 | 1551425130425534352 |
7 | 60235304066261633 |
oct | 5556534622116474 |
9 | 871085782185035 |
10 | 201120002121020 |
11 | 590a0572011974 |
12 | 1a6824a19443b8 |
13 | 882b6c5005308 |
14 | 379438d7a651a |
15 | 183b8d5a79865 |
hex | b6eae6489d3c |
201120002121020 has 48 divisors (see below), whose sum is σ = 447242738211360. Its totient is φ = 75707892793344.
The previous prime is 201120002121001. The next prime is 201120002121041. The reversal of 201120002121020 is 20121200021102.
It is a junction number, because it is equal to n+sod(n) for n = 201120002120986 and 201120002121004.
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, 27477509 + ... + 34018428.
It is an arithmetic number, because the mean of its divisors is an integer number (9317557046070).
Almost surely, 2201120002121020 is an apocalyptic number.
201120002121020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201120002121020 is an abundant number, since it is smaller than the sum of its proper divisors (246122736090340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201120002121020 is a wasteful number, since it uses less digits than its factorization.
201120002121020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61505582 (or 61505580 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201120002121020 its reverse (20121200021102), we get a palindrome (221241202142122).
The spelling of 201120002121020 in words is "two hundred one trillion, one hundred twenty billion, two million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •