Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …111001000011110100111011 |
3 | 112200221121211001000112001022 |
4 | 121133122223321003310323 |
5 | 104143303011234101021 |
6 | 1034234402255213055 |
7 | 32420455201462562 |
oct | 3137325371036473 |
9 | 480847731015038 |
10 | 112110120222011 |
11 | 327a36a918471a |
12 | 106a783851718b |
13 | 4a72c28c066c2 |
14 | 1d9823194abd9 |
15 | ce63951341ab |
hex | 65f6abe43d3b |
112110120222011 has 8 divisors (see below), whose sum is σ = 112138137324000. Its totient is φ = 112082103846720.
The previous prime is 112110120221977. The next prime is 112110120222103. The reversal of 112110120222011 is 110222021011211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112110120222011 - 218 = 112110119959867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112110120222911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 438918965 + ... + 439174313.
It is an arithmetic number, because the mean of its divisors is an integer number (14017267165500).
Almost surely, 2112110120222011 is an apocalyptic number.
112110120222011 is a deficient number, since it is larger than the sum of its proper divisors (28017101989).
112110120222011 is a wasteful number, since it uses less digits than its factorization.
112110120222011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363349.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 112110120222011 its reverse (110222021011211), we get a palindrome (222332141233222).
The spelling of 112110120222011 in words is "one hundred twelve trillion, one hundred ten billion, one hundred twenty million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •