Base | Representation |
---|---|
bin | 11001000010010101111000… |
… | …101011000011111111010001 |
3 | 112102212121120122120211000112 |
4 | 121002111320223003333101 |
5 | 103413034040341401001 |
6 | 1030104444555531105 |
7 | 32123223341366246 |
oct | 3102257053037721 |
9 | 472777518524015 |
10 | 110112101122001 |
11 | 320a3309515370 |
12 | 10424567a59a95 |
13 | 49596acb8cb04 |
14 | 1d296501c35cd |
15 | cae405ee4cbb |
hex | 642578ac3fd1 |
110112101122001 has 32 divisors (see below), whose sum is σ = 121754070079488. Its totient is φ = 98745872221440.
The previous prime is 110112101121877. The next prime is 110112101122039. The reversal of 110112101122001 is 100221101211011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110112101122001 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110112101122901) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1618714076 + ... + 1618782098.
It is an arithmetic number, because the mean of its divisors is an integer number (3804814689984).
Almost surely, 2110112101122001 is an apocalyptic number.
110112101122001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110112101122001 is a deficient number, since it is larger than the sum of its proper divisors (11641968957487).
110112101122001 is a wasteful number, since it uses less digits than its factorization.
110112101122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70781.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110112101122001 its reverse (100221101211011), we get a palindrome (210333202333012).
The spelling of 110112101122001 in words is "one hundred ten trillion, one hundred twelve billion, one hundred one million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •