Base | Representation |
---|---|
bin | 101101100001010011101110… |
… | …001001001111011100010111 |
3 | 222020212000210200021220212102 |
4 | 231201103232021033130113 |
5 | 202220043132304013421 |
6 | 1545443024052512315 |
7 | 60112021453531601 |
oct | 5541235611173427 |
9 | 866760720256772 |
10 | 200201011001111 |
11 | 5887685453165a |
12 | 1a55436961b69b |
13 | 8792b49b9a663 |
14 | 3761ad00b8171 |
15 | 1822a4b16960b |
hex | b614ee24f717 |
200201011001111 has 8 divisors (see below), whose sum is σ = 208908439924704. Its totient is φ = 191493835172640.
The previous prime is 200201011001053. The next prime is 200201011001119. The reversal of 200201011001111 is 111100110102002.
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-200201011001111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200201011001092 and 200201011001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200201011001119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61656476 + ... + 64822241.
It is an arithmetic number, because the mean of its divisors is an integer number (26113554990588).
Almost surely, 2200201011001111 is an apocalyptic number.
200201011001111 is a deficient number, since it is larger than the sum of its proper divisors (8707428923593).
200201011001111 is a wasteful number, since it uses less digits than its factorization.
200201011001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 126547561.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 200201011001111 its reverse (111100110102002), we get a palindrome (311301121103113).
The spelling of 200201011001111 in words is "two hundred trillion, two hundred one billion, eleven million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •