Base | Representation |
---|---|
bin | 101101100001010011111010… |
… | …000101000001100010111011 |
3 | 222020212001022122001012120102 |
4 | 231201103322011001202323 |
5 | 202220044040033102303 |
6 | 1545443100004150015 |
7 | 60112026434426552 |
oct | 5541237205014273 |
9 | 866761278035512 |
10 | 200201211222203 |
11 | 58876947555734 |
12 | 1a55440469830b |
13 | 8792b7c501489 |
14 | 3761b0c916d99 |
15 | 1822a5da19288 |
hex | b614fa1418bb |
200201211222203 has 8 divisors (see below), whose sum is σ = 206837009872896. Its totient is φ = 193576518513000.
The previous prime is 200201211222107. The next prime is 200201211222247. The reversal of 200201211222203 is 302222112102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200201211222203 - 224 = 200201194444987 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200201211222293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2776448723 + ... + 2776520828.
It is an arithmetic number, because the mean of its divisors is an integer number (25854626234112).
Almost surely, 2200201211222203 is an apocalyptic number.
200201211222203 is a deficient number, since it is larger than the sum of its proper divisors (6635798650693).
200201211222203 is a wasteful number, since it uses less digits than its factorization.
200201211222203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5552970745.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 200201211222203 its reverse (302222112102002), we get a palindrome (502423323324205).
The spelling of 200201211222203 in words is "two hundred trillion, two hundred one billion, two hundred eleven million, two hundred twenty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •