Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0111001110010000001 |
3 | 101111221221012022220201 |
4 | 1212131032321302001 |
5 | 3300301100041001 |
6 | 122312221205201 |
7 | 10643126344261 |
oct | 1463516716201 |
9 | 344857168821 |
10 | 110012112001 |
11 | 42723a73030 |
12 | 193a2a00801 |
13 | a4b2b7ab7c |
14 | 5478a577a1 |
15 | 2cdd1db501 |
hex | 199d3b9c81 |
110012112001 has 8 divisors (see below), whose sum is σ = 120074750208. Its totient is φ = 99959730000.
The previous prime is 110012111981. The next prime is 110012112011. The reversal of 110012112001 is 100211210011.
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 110012112001 - 235 = 75652373633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110012112011) 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, 2541610 + ... + 2584531.
It is an arithmetic number, because the mean of its divisors is an integer number (15009343776).
Almost surely, 2110012112001 is an apocalyptic number.
110012112001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110012112001 is a deficient number, since it is larger than the sum of its proper divisors (10062638207).
110012112001 is a wasteful number, since it uses less digits than its factorization.
110012112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5128103.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110012112001 its reverse (100211210011), we get a palindrome (210223322012).
The spelling of 110012112001 in words is "one hundred ten billion, twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •