Base | Representation |
---|---|
bin | 1011000001011110111001… |
… | …0100100100100100101111 |
3 | 1120220200002200111202000220 |
4 | 2300113232110210210233 |
5 | 3042033431341041421 |
6 | 41435521513422423 |
7 | 2360435255431266 |
oct | 260275624444457 |
9 | 46820080452026 |
10 | 12120101112111 |
11 | 395311911aa53 |
12 | 1438b5940aa13 |
13 | 69bbc78199b5 |
14 | 2dc88a5255dd |
15 | 160411bea3c6 |
hex | b05ee52492f |
12120101112111 has 4 divisors (see below), whose sum is σ = 16160134816152. Its totient is φ = 8080067408072.
The previous prime is 12120101112071. The next prime is 12120101112139. The reversal of 12120101112111 is 11121110102121.
12120101112111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12120101112111 - 27 = 12120101111983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120101112011) 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, 2020016852016 + ... + 2020016852021.
It is an arithmetic number, because the mean of its divisors is an integer number (4040033704038).
Almost surely, 212120101112111 is an apocalyptic number.
12120101112111 is a deficient number, since it is larger than the sum of its proper divisors (4040033704041).
12120101112111 is an equidigital number, since it uses as much as digits as its factorization.
12120101112111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4040033704040.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12120101112111 its reverse (11121110102121), we get a palindrome (23241211214232).
The spelling of 12120101112111 in words is "twelve trillion, one hundred twenty billion, one hundred one million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •