Base | Representation |
---|---|
bin | 101101101101000110000101… |
… | …010111101110100111111111 |
3 | 222100201110112100021111122102 |
4 | 231231012011113232213333 |
5 | 202321331013003310421 |
6 | 1551303102435135315 |
7 | 60224365005521006 |
oct | 5555060527564777 |
9 | 870643470244572 |
10 | 201011002010111 |
11 | 5905931831a287 |
12 | 1a665341a4453b |
13 | 8821343a06c77 |
14 | 378cdad301c3d |
15 | 1838b5664060b |
hex | b6d1855ee9ff |
201011002010111 has 8 divisors (see below), whose sum is σ = 201064265767680. Its totient is φ = 200957739443928.
The previous prime is 201011002010107. The next prime is 201011002010113. The reversal of 201011002010111 is 111010200110102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201011002010111 - 22 = 201011002010107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201011002010092 and 201011002010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011002010113) 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, 412324460 + ... + 412811678.
It is an arithmetic number, because the mean of its divisors is an integer number (25133033220960).
Almost surely, 2201011002010111 is an apocalyptic number.
201011002010111 is a deficient number, since it is larger than the sum of its proper divisors (53263757569).
201011002010111 is a wasteful number, since it uses less digits than its factorization.
201011002010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 595693.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201011002010111 its reverse (111010200110102), we get a palindrome (312021202120213).
The spelling of 201011002010111 in words is "two hundred one trillion, eleven billion, two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •