Base | Representation |
---|---|
bin | 100000000010001001100… |
… | …011011001000110110100 |
3 | 21210110000112122221200222 |
4 | 200002021203121012310 |
5 | 242031311214341040 |
6 | 4403135535153512 |
7 | 315020014604420 |
oct | 40021143310664 |
9 | 7713015587628 |
10 | 2201331012020 |
11 | 779640a71018 |
12 | 2b6771375898 |
13 | 12c77a55900a |
14 | 7878b645b80 |
15 | 3c3dd21abb5 |
hex | 200898d91b4 |
2201331012020 has 48 divisors (see below), whose sum is σ = 5284366606848. Its totient is φ = 754574607360.
The previous prime is 2201331012007. The next prime is 2201331012029. The reversal of 2201331012020 is 202101331022.
It is a self number, because there is not a number n which added to its sum of digits gives 2201331012020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201331012029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1110236 + ... + 2373875.
It is an arithmetic number, because the mean of its divisors is an integer number (110090970976).
Almost surely, 22201331012020 is an apocalyptic number.
2201331012020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2201331012020 is an abundant number, since it is smaller than the sum of its proper divisors (3083035594828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201331012020 is a wasteful number, since it uses less digits than its factorization.
2201331012020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3488640 (or 3488638 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2201331012020 its reverse (202101331022), we get a palindrome (2403432343042).
The spelling of 2201331012020 in words is "two trillion, two hundred one billion, three hundred thirty-one million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •