Base | Representation |
---|---|
bin | 100000000010001000011… |
… | …111100011110111011111 |
3 | 21210102222022012112202212 |
4 | 200002020133203313133 |
5 | 242031242141332203 |
6 | 4403134102111035 |
7 | 315016410504605 |
oct | 40021037436737 |
9 | 7712868175685 |
10 | 2201313230303 |
11 | 779631a26390 |
12 | 2b676741b47b |
13 | 12c7769714a5 |
14 | 78789137875 |
15 | 3c3db8a71d8 |
hex | 200887e3ddf |
2201313230303 has 4 divisors (see below), whose sum is σ = 2401432614888. Its totient is φ = 2001193845720.
The previous prime is 2201313230297. The next prime is 2201313230317. The reversal of 2201313230303 is 3030323131022.
2201313230303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2201313230303 - 26 = 2201313230239 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 (2201313230393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100059692276 + ... + 100059692297.
It is an arithmetic number, because the mean of its divisors is an integer number (600358153722).
Almost surely, 22201313230303 is an apocalyptic number.
2201313230303 is a deficient number, since it is larger than the sum of its proper divisors (200119384585).
2201313230303 is a wasteful number, since it uses less digits than its factorization.
2201313230303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200119384584.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 2201313230303 its reverse (3030323131022), we get a palindrome (5231636361325).
The spelling of 2201313230303 in words is "two trillion, two hundred one billion, three hundred thirteen million, two hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •