Base | Representation |
---|---|
bin | 11001011110000110110110… |
… | …110111101100101000001001 |
3 | 112200122000111002002121111202 |
4 | 121132012312313230220021 |
5 | 104140314141141213001 |
6 | 1034125154514033545 |
7 | 32411120520203654 |
oct | 3136066667545011 |
9 | 480560432077452 |
10 | 112020110101001 |
11 | 32769509880563 |
12 | 106922b82788b5 |
13 | 4a675b2c7c77b |
14 | 1d93b3357689b |
15 | ce3d77e5896b |
hex | 65e1b6deca09 |
112020110101001 has 4 divisors (see below), whose sum is σ = 112020535000272. Its totient is φ = 112019685201732.
The previous prime is 112020110100989. The next prime is 112020110101021. The reversal of 112020110101001 is 100101011020211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112020110101001 - 210 = 112020110099977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112020110101021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212053931 + ... + 212581536.
It is an arithmetic number, because the mean of its divisors is an integer number (28005133750068).
Almost surely, 2112020110101001 is an apocalyptic number.
It is an amenable number.
112020110101001 is a deficient number, since it is larger than the sum of its proper divisors (424899271).
112020110101001 is an equidigital number, since it uses as much as digits as its factorization.
112020110101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424899270.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112020110101001 its reverse (100101011020211), we get a palindrome (212121121121212).
The spelling of 112020110101001 in words is "one hundred twelve trillion, twenty billion, one hundred ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •