Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0111001010011000101 |
3 | 101111221221012020012101 |
4 | 1212131032321103011 |
5 | 3300301100010041 |
6 | 122312221152101 |
7 | 10643126335432 |
oct | 1463516712305 |
9 | 344857166171 |
10 | 110012110021 |
11 | 42723a715a0 |
12 | 193a29bb631 |
13 | a4b2b79cb8 |
14 | 5478a56b89 |
15 | 2cdd1dab31 |
hex | 199d3b94c5 |
110012110021 has 8 divisors (see below), whose sum is σ = 120060324000. Its totient is φ = 99971748240.
The previous prime is 110012110003. The next prime is 110012110133. The reversal of 110012110021 is 120011210011.
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 110012110021 - 221 = 110010012869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012110001) 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, 1933731 + ... + 1989808.
It is an arithmetic number, because the mean of its divisors is an integer number (15007540500).
Almost surely, 2110012110021 is an apocalyptic number.
110012110021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110012110021 is a deficient number, since it is larger than the sum of its proper divisors (10048213979).
110012110021 is a wasteful number, since it uses less digits than its factorization.
110012110021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3926099.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110012110021 its reverse (120011210011), we get a palindrome (230023320032).
It can be divided in two parts, 1100 and 12110021, that added together give a palindrome (12111121).
The spelling of 110012110021 in words is "one hundred ten billion, twelve million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •