Base | Representation |
---|---|
bin | 1011000000111001101101… |
… | …1110001110100111101111 |
3 | 1120212201100011112200110112 |
4 | 2300032123132032213233 |
5 | 3041403012011400421 |
6 | 41431151325330235 |
7 | 2356633043533034 |
oct | 260163336164757 |
9 | 46781304480415 |
10 | 12110121200111 |
11 | 39499677863a0 |
12 | 143703310697b |
13 | 69ac97043a1c |
14 | 2dc1c0d1138b |
15 | 16002a9a945b |
hex | b039b78e9ef |
12110121200111 has 8 divisors (see below), whose sum is σ = 13427615757648. Its totient is φ = 10828722384000.
The previous prime is 12110121200063. The next prime is 12110121200117. The reversal of 12110121200111 is 11100212101121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12110121200111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110121200117) 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, 9023934650 + ... + 9023935991.
It is an arithmetic number, because the mean of its divisors is an integer number (1678451969706).
Almost surely, 212110121200111 is an apocalyptic number.
12110121200111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12110121200111 is a deficient number, since it is larger than the sum of its proper divisors (1317494557537).
12110121200111 is a wasteful number, since it uses less digits than its factorization.
12110121200111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18047870713.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12110121200111 its reverse (11100212101121), we get a palindrome (23210333301232).
The spelling of 12110121200111 in words is "twelve trillion, one hundred ten billion, one hundred twenty-one million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •