Base | Representation |
---|---|
bin | 11011100011101100011001… |
… | …100100011010100000111011 |
3 | 120220010121200010112201020012 |
4 | 123203230121210122200323 |
5 | 111341220311420231021 |
6 | 1105434321250452135 |
7 | 34346263511221604 |
oct | 3343543144324073 |
9 | 526117603481205 |
10 | 121200111102011 |
11 | 35688751044947 |
12 | 11715487b9404b |
13 | 5282176a444c6 |
14 | 21d018c238dab |
15 | e02a5de8a35b |
hex | 6e3b1991a83b |
121200111102011 has 4 divisors (see below), whose sum is σ = 121207744808832. Its totient is φ = 121192477395192.
The previous prime is 121200111101963. The next prime is 121200111102047. The reversal of 121200111102011 is 110201111002121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121200111102011 is a prime.
It is a super-2 number, since 2×1212001111020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121200111122011) 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, 3816829595 + ... + 3816861348.
It is an arithmetic number, because the mean of its divisors is an integer number (30301936202208).
Almost surely, 2121200111102011 is an apocalyptic number.
121200111102011 is a deficient number, since it is larger than the sum of its proper divisors (7633706821).
121200111102011 is an equidigital number, since it uses as much as digits as its factorization.
121200111102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7633706820.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 121200111102011 its reverse (110201111002121), we get a palindrome (231401222104132).
The spelling of 121200111102011 in words is "one hundred twenty-one trillion, two hundred billion, one hundred eleven million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •