Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010010000001010110001 |
3 | 222020212222120211100200221201 |
4 | 231201131001202100022301 |
5 | 202220224112000014301 |
6 | 1545451355203451201 |
7 | 60112524135611050 |
oct | 5541350142201261 |
9 | 866788524320851 |
10 | 200211000001201 |
11 | 58880010013232 |
12 | 1a556296986b01 |
13 | 8793a7c5060b7 |
14 | 376239a9b6397 |
15 | 1822e330a3201 |
hex | b617418902b1 |
200211000001201 has 8 divisors (see below), whose sum is σ = 228916435529024. Its totient is φ = 171531530498160.
The previous prime is 200211000001189. The next prime is 200211000001211. The reversal of 200211000001201 is 102100000112002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200211000001201 - 29 = 200211000000689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200211000001211) 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, 6491489670 + ... + 6491520511.
It is an arithmetic number, because the mean of its divisors is an integer number (28614554441128).
Almost surely, 2200211000001201 is an apocalyptic number.
It is an amenable number.
200211000001201 is a deficient number, since it is larger than the sum of its proper divisors (28705435527823).
200211000001201 is a wasteful number, since it uses less digits than its factorization.
200211000001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12983012391.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200211000001201 its reverse (102100000112002), we get a palindrome (302311000113203).
The spelling of 200211000001201 in words is "two hundred trillion, two hundred eleven billion, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •