Base | Representation |
---|---|
bin | 11001100000111001110001… |
… | …000010010101010001010010 |
3 | 112201022101022222201210212112 |
4 | 121200321301002111101102 |
5 | 104201441102233341424 |
6 | 1034353324544425322 |
7 | 32431031135412524 |
oct | 3140716102252122 |
9 | 481271288653775 |
10 | 112212212012114 |
11 | 32832a28350675 |
12 | 1070358a918242 |
13 | 4a7c748bbb166 |
14 | 1d9d15871ba14 |
15 | ce8d6cd1360e |
hex | 660e71095452 |
112212212012114 has 4 divisors (see below), whose sum is σ = 168318318018174. Its totient is φ = 56106106006056.
The previous prime is 112212212012083. The next prime is 112212212012119. The reversal of 112212212012114 is 411210212212211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 61992553396225 + 50219658615889 = 7873535^2 + 7086583^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 112212212012114.
It is not an unprimeable number, because it can be changed into a prime (112212212012119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28053053003027 + ... + 28053053003030.
Almost surely, 2112212212012114 is an apocalyptic number.
112212212012114 is a deficient number, since it is larger than the sum of its proper divisors (56106106006060).
112212212012114 is an equidigital number, since it uses as much as digits as its factorization.
112212212012114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56106106006059.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 112212212012114 its reverse (411210212212211), we get a palindrome (523422424224325).
The spelling of 112212212012114 in words is "one hundred twelve trillion, two hundred twelve billion, two hundred twelve million, twelve thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •