Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …001001010011110101110001 |
3 | 112200120021202210112000010111 |
4 | 121131312000021103311301 |
5 | 104140020110044231001 |
6 | 1034113003011101321 |
7 | 32406610161562330 |
oct | 3135660011236561 |
9 | 480507683460114 |
10 | 112002012102001 |
11 | 32761871a43a9a |
12 | 1068a8a72a1841 |
13 | 4a6598a659418 |
14 | 1d92cd7b19d17 |
15 | ce3669193851 |
hex | 65dd80253d71 |
112002012102001 has 8 divisors (see below), whose sum is σ = 133567616916864. Its totient is φ = 91827736630080.
The previous prime is 112002012101911. The next prime is 112002012102011. The reversal of 112002012102001 is 100201210200211.
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 112002012102001 - 217 = 112002011970929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112002012102011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 347832335560 + ... + 347832335881.
It is an arithmetic number, because the mean of its divisors is an integer number (16695952114608).
Almost surely, 2112002012102001 is an apocalyptic number.
It is an amenable number.
112002012102001 is a deficient number, since it is larger than the sum of its proper divisors (21565604814863).
112002012102001 is an equidigital number, since it uses as much as digits as its factorization.
112002012102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695664671471.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112002012102001 its reverse (100201210200211), we get a palindrome (212203222302212).
The spelling of 112002012102001 in words is "one hundred twelve trillion, two billion, twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •