Base | Representation |
---|---|
bin | 100000000010001000011… |
… | …010110111111111100100 |
3 | 21210102222012220010212220 |
4 | 200002020122313333210 |
5 | 242031241333031040 |
6 | 4403134015512340 |
7 | 315016364200605 |
oct | 40021032677744 |
9 | 7712865803786 |
10 | 2201312002020 |
11 | 77963126757a |
12 | 2b6766b286b0 |
13 | 12c7766313b1 |
14 | 78788cd7dac |
15 | 3c3db7132d0 |
hex | 200886b7fe4 |
2201312002020 has 24 divisors (see below), whose sum is σ = 6163673605824. Its totient is φ = 587016533856.
The previous prime is 2201312002013. The next prime is 2201312002051. The reversal of 2201312002020 is 202002131022.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18344266624 + ... + 18344266743.
It is an arithmetic number, because the mean of its divisors is an integer number (256819733576).
Almost surely, 22201312002020 is an apocalyptic number.
2201312002020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2201312002020 is an abundant number, since it is smaller than the sum of its proper divisors (3962361603804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201312002020 is a wasteful number, since it uses less digits than its factorization.
2201312002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36688533379 (or 36688533377 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2201312002020 its reverse (202002131022), we get a palindrome (2403314133042).
The spelling of 2201312002020 in words is "two trillion, two hundred one billion, three hundred twelve million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •