Base | Representation |
---|---|
bin | 11001010000101101111100… |
… | …001110011010110000000001 |
3 | 112120101001112020122010102101 |
4 | 121100231330032122300001 |
5 | 104030230301304400001 |
6 | 1032142345321550401 |
7 | 32254465435452544 |
oct | 3120557416326001 |
9 | 476331466563371 |
10 | 111100003200001 |
11 | 32444279487412 |
12 | 10563b12345401 |
13 | 49cb8ba92a10a |
14 | 1d613a99dc85b |
15 | cc9e755e6a01 |
hex | 650b7c39ac01 |
111100003200001 has 8 divisors (see below), whose sum is σ = 112186728068480. Its totient is φ = 110013433794432.
The previous prime is 111100003199971. The next prime is 111100003200007. The reversal of 111100003200001 is 100002300001111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111100003200001 is a prime.
It is a super-2 number, since 2×1111000032000012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111100003200007) 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, 37429200 + ... + 40288273.
It is an arithmetic number, because the mean of its divisors is an integer number (14023341008560).
Almost surely, 2111100003200001 is an apocalyptic number.
It is an amenable number.
111100003200001 is a deficient number, since it is larger than the sum of its proper divisors (1086724868479).
111100003200001 is a wasteful number, since it uses less digits than its factorization.
111100003200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77731455.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 111100003200001 its reverse (100002300001111), we get a palindrome (211102303201112).
The spelling of 111100003200001 in words is "one hundred eleven trillion, one hundred billion, three million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •