Base | Representation |
---|---|
bin | 100000000001001101011… |
… | …110001011101010110101 |
3 | 21210100102021221022102002 |
4 | 200001031132023222311 |
5 | 242022230142411201 |
6 | 4402451530225045 |
7 | 314653025010560 |
oct | 40011536135265 |
9 | 7710367838362 |
10 | 2200323013301 |
11 | 779173a84726 |
12 | 2b652b885185 |
13 | 12c64977b17a |
14 | 786d38154d7 |
15 | 3c37e9a976b |
hex | 2004d78bab5 |
2200323013301 has 8 divisors (see below), whose sum is σ = 2516200463040. Its totient is φ = 1884831961248.
The previous prime is 2200323013271. The next prime is 2200323013327. The reversal of 2200323013301 is 1033103230022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2200323013301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200323016301) by changing a digit.
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, 96587216 + ... + 96609993.
It is an arithmetic number, because the mean of its divisors is an integer number (314525057880).
Almost surely, 22200323013301 is an apocalyptic number.
It is an amenable number.
2200323013301 is a deficient number, since it is larger than the sum of its proper divisors (315877449739).
2200323013301 is a wasteful number, since it uses less digits than its factorization.
2200323013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193198843.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2200323013301 its reverse (1033103230022), we get a palindrome (3233426243323).
The spelling of 2200323013301 in words is "two trillion, two hundred billion, three hundred twenty-three million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •