Base | Representation |
---|---|
bin | 11001011110001000110011… |
… | …011111111010111001100001 |
3 | 112200122012212210112022011012 |
4 | 121132020303133322321201 |
5 | 104140332431430120001 |
6 | 1034130142205430305 |
7 | 32411223366546506 |
oct | 3136106337727141 |
9 | 480565783468135 |
10 | 112022201020001 |
11 | 3276a392076998 |
12 | 106927a056b395 |
13 | 4a6785720b14c |
14 | 1d93c9113b4ad |
15 | ce3e4b7ca2bb |
hex | 65e2337fae61 |
112022201020001 has 8 divisors (see below), whose sum is σ = 112515111072000. Its totient is φ = 111529492617760.
The previous prime is 112022201019961. The next prime is 112022201020061. The reversal of 112022201020001 is 100020102220211.
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 112022201020001 - 238 = 111747323113057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112022201020061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49298885 + ... + 51521106.
It is an arithmetic number, because the mean of its divisors is an integer number (14064388884000).
Almost surely, 2112022201020001 is an apocalyptic number.
It is an amenable number.
112022201020001 is a deficient number, since it is larger than the sum of its proper divisors (492910051999).
112022201020001 is a wasteful number, since it uses less digits than its factorization.
112022201020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100824879.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112022201020001 its reverse (100020102220211), we get a palindrome (212042303240212).
It can be divided in two parts, 11202220 and 1020001, that added together give a palindrome (12222221).
The spelling of 112022201020001 in words is "one hundred twelve trillion, twenty-two billion, two hundred one million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •