Base | Representation |
---|---|
bin | 101101101101000101001111… |
… | …100111100110011010010111 |
3 | 222100201101012111100212021002 |
4 | 231231011033213212122113 |
5 | 202321322141122413421 |
6 | 1551302433142213515 |
7 | 60224333445336155 |
oct | 5555051747463227 |
9 | 870641174325232 |
10 | 201010100201111 |
11 | 590589a5271893 |
12 | 1a66512ba2429b |
13 | 882122bc29086 |
14 | 378cd256343d5 |
15 | 1838b023a7b0b |
hex | b6d14f9e6697 |
201010100201111 has 8 divisors (see below), whose sum is σ = 207495038091264. Its totient is φ = 194525208630360.
The previous prime is 201010100201101. The next prime is 201010100201123. The reversal of 201010100201111 is 111102001010102.
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 201010100201111 - 246 = 130641356023447 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201010100201092 and 201010100201101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201010100201101) 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, 2651255 + ... + 20224968.
It is an arithmetic number, because the mean of its divisors is an integer number (25936879761408).
Almost surely, 2201010100201111 is an apocalyptic number.
201010100201111 is a deficient number, since it is larger than the sum of its proper divisors (6484937890153).
201010100201111 is a wasteful number, since it uses less digits than its factorization.
201010100201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23159701.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201010100201111 its reverse (111102001010102), we get a palindrome (312112101211213).
The spelling of 201010100201111 in words is "two hundred one trillion, ten billion, one hundred million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •