Base | Representation |
---|---|
bin | 100000000010000001110… |
… | …000011011010101100101 |
3 | 21210102200102112120211220 |
4 | 200002001300123111211 |
5 | 242031024223230201 |
6 | 4403114543450553 |
7 | 315013536040260 |
oct | 40020160332545 |
9 | 7712612476756 |
10 | 2201200211301 |
11 | 779584152553 |
12 | 2b67355b6a59 |
13 | 12c75941cc40 |
14 | 78778117cd7 |
15 | 3c3d19d0036 |
hex | 20081c1b565 |
2201200211301 has 16 divisors (see below), whose sum is σ = 3612225988224. Its totient is φ = 1161072638784.
The previous prime is 2201200211291. The next prime is 2201200211317. The reversal of 2201200211301 is 1031120021022.
It is not a de Polignac number, because 2201200211301 - 27 = 2201200211173 is a prime.
It is a super-2 number, since 2×22012002113012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201200211351) 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, 4031501946 + ... + 4031502491.
It is an arithmetic number, because the mean of its divisors is an integer number (225764124264).
Almost surely, 22201200211301 is an apocalyptic number.
2201200211301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2201200211301 is a deficient number, since it is larger than the sum of its proper divisors (1411025776923).
2201200211301 is a wasteful number, since it uses less digits than its factorization.
2201200211301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8063004460.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 2201200211301 its reverse (1031120021022), we get a palindrome (3232320232323).
The spelling of 2201200211301 in words is "two trillion, two hundred one billion, two hundred million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •