Base | Representation |
---|---|
bin | 10001011110101000011… |
… | …001000010110101110111 |
3 | 11020211022012002110212120 |
4 | 101132220121002311313 |
5 | 124134343434404421 |
6 | 2315442023451023 |
7 | 152530620104565 |
oct | 21365031026567 |
9 | 4224265073776 |
10 | 1201121013111 |
11 | 423435553908 |
12 | 174950bb6a73 |
13 | 8935a914c86 |
14 | 421c5376a35 |
15 | 2139d3228c6 |
hex | 117a8642d77 |
1201121013111 has 8 divisors (see below), whose sum is σ = 1604081915520. Its totient is φ = 799453726392.
The previous prime is 1201121013109. The next prime is 1201121013137. The reversal of 1201121013111 is 1113101211021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1201121013111 - 21 = 1201121013109 is a prime.
It is a super-3 number, since 3×12011210131113 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201121013611) 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, 323401755 + ... + 323405468.
It is an arithmetic number, because the mean of its divisors is an integer number (200510239440).
Almost surely, 21201121013111 is an apocalyptic number.
1201121013111 is a deficient number, since it is larger than the sum of its proper divisors (402960902409).
1201121013111 is an equidigital number, since it uses as much as digits as its factorization.
1201121013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646807845.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 1201121013111 its reverse (1113101211021), we get a palindrome (2314222224132).
The spelling of 1201121013111 in words is "one trillion, two hundred one billion, one hundred twenty-one million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •