Base | Representation |
---|---|
bin | 100000000011111111100… |
… | …100111100110101110100 |
3 | 21210122010112121110200202 |
4 | 200003333210330311310 |
5 | 242044340122211040 |
6 | 4404104232100032 |
7 | 315120050420135 |
oct | 40037744746564 |
9 | 7718115543622 |
10 | 2203311132020 |
11 | 77a46776a529 |
12 | 2b7024534618 |
13 | 12ca0486275b |
14 | 788d8607c8c |
15 | 3c4a6ea3015 |
hex | 200ff93cd74 |
2203311132020 has 24 divisors (see below), whose sum is σ = 4627646419200. Its totient is φ = 881192444832.
The previous prime is 2203311132019. The next prime is 2203311132047. The reversal of 2203311132020 is 202311133022.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 2203311131983 and 2203311132001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8113580 + ... + 8380739.
It is an arithmetic number, because the mean of its divisors is an integer number (192818600800).
Almost surely, 22203311132020 is an apocalyptic number.
2203311132020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2203311132020 is an abundant number, since it is smaller than the sum of its proper divisors (2424335287180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2203311132020 is a wasteful number, since it uses less digits than its factorization.
2203311132020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16501007 (or 16501005 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2203311132020 its reverse (202311133022), we get a palindrome (2405622265042).
The spelling of 2203311132020 in words is "two trillion, two hundred three billion, three hundred eleven million, one hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •