Base | Representation |
---|---|
bin | 11001011101111111011010… |
… | …001010001010110010110001 |
3 | 112200121020211200122201011001 |
4 | 121131333122022022302301 |
5 | 104140201301211223441 |
6 | 1034121353131322001 |
7 | 32410415363232523 |
oct | 3135773212126261 |
9 | 480536750581131 |
10 | 112012112211121 |
11 | 32766085214511 |
12 | 106908458b0301 |
13 | 4a66909cc7c55 |
14 | 1d935b529ba13 |
15 | ce3a5ac28731 |
hex | 65dfda28acb1 |
112012112211121 has 4 divisors (see below), whose sum is σ = 112026242673472. Its totient is φ = 111997981748772.
The previous prime is 112012112211089. The next prime is 112012112211133. The reversal of 112012112211121 is 121112211210211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112012112211121 - 25 = 112012112211089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112012112211191) 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, 7065219285 + ... + 7065235138.
It is an arithmetic number, because the mean of its divisors is an integer number (28006560668368).
Almost surely, 2112012112211121 is an apocalyptic number.
It is an amenable number.
112012112211121 is a deficient number, since it is larger than the sum of its proper divisors (14130462351).
112012112211121 is an equidigital number, since it uses as much as digits as its factorization.
112012112211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14130462350.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 112012112211121 its reverse (121112211210211), we get a palindrome (233124323421332).
The spelling of 112012112211121 in words is "one hundred twelve trillion, twelve billion, one hundred twelve million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •