Base | Representation |
---|---|
bin | 10001011110100111101… |
… | …111000111000000001111 |
3 | 11020211021102101222022102 |
4 | 101132213233013000033 |
5 | 124134333131120421 |
6 | 2315440552105315 |
7 | 152530424501201 |
oct | 21364757070017 |
9 | 4224242358272 |
10 | 1201110020111 |
11 | 42342a325691 |
12 | 17494939523b |
13 | 89358566441 |
14 | 421c3b14771 |
15 | 2139c3a060b |
hex | 117a7bc700f |
1201110020111 has 4 divisors (see below), whose sum is σ = 1201112229432. Its totient is φ = 1201107810792.
The previous prime is 1201110020053. The next prime is 1201110020141. The reversal of 1201110020111 is 1110200111021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1201110020111 - 234 = 1183930150927 is a prime.
It is a super-2 number, since 2×12011100201112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201110020092 and 1201110020101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201110020141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 344681 + ... + 1587773.
It is an arithmetic number, because the mean of its divisors is an integer number (300278057358).
Almost surely, 21201110020111 is an apocalyptic number.
1201110020111 is a deficient number, since it is larger than the sum of its proper divisors (2209321).
1201110020111 is an equidigital number, since it uses as much as digits as its factorization.
1201110020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2209320.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1201110020111 its reverse (1110200111021), we get a palindrome (2311310131132).
The spelling of 1201110020111 in words is "one trillion, two hundred one billion, one hundred ten million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •