Base | Representation |
---|---|
bin | 11001100001000001001000… |
… | …011001001101101010011001 |
3 | 112201100010202010011020020201 |
4 | 121201001020121031222121 |
5 | 104202103301220012001 |
6 | 1034401113402022201 |
7 | 32431431122026234 |
oct | 3141011031155231 |
9 | 481303663136221 |
10 | 112220120079001 |
11 | 32836316237340 |
12 | 107050171a7961 |
13 | 4a8040938348c |
14 | 1d9d6a8ad441b |
15 | ce91821ee501 |
hex | 66104864da99 |
112220120079001 has 8 divisors (see below), whose sum is σ = 126643395700800. Its totient is φ = 98500418877840.
The previous prime is 112220120078977. The next prime is 112220120079013. The reversal of 112220120079001 is 100970021022211.
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 112220120079001 - 27 = 112220120078873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112220120079401) 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 in 7 ways as a sum of consecutive naturals, for example, 175893604821 + ... + 175893605458.
It is an arithmetic number, because the mean of its divisors is an integer number (15830424462600).
Almost surely, 2112220120079001 is an apocalyptic number.
112220120079001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112220120079001 is a deficient number, since it is larger than the sum of its proper divisors (14423275621799).
112220120079001 is a wasteful number, since it uses less digits than its factorization.
112220120079001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351787210319.
The product of its (nonzero) digits is 1008, while the sum is 28.
The spelling of 112220120079001 in words is "one hundred twelve trillion, two hundred twenty billion, one hundred twenty million, seventy-nine thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •