Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0110110111000000101 |
3 | 101111221221011201120222 |
4 | 1212131032312320011 |
5 | 3300301044200401 |
6 | 122312221034125 |
7 | 10643126264501 |
oct | 1463516667005 |
9 | 344857151528 |
10 | 110012100101 |
11 | 42723a650a2 |
12 | 193a29b5945 |
13 | a4b2b75627 |
14 | 5478a53301 |
15 | 2cdd1d7c1b |
hex | 199d3b6e05 |
110012100101 has 4 divisors (see below), whose sum is σ = 114795234912. Its totient is φ = 105228965292.
The previous prime is 110012100061. The next prime is 110012100109. The reversal of 110012100101 is 101001210011.
It is a happy number.
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 not a de Polignac number, because 110012100101 - 210 = 110012099077 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 (110012100109) 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, 2391567371 + ... + 2391567416.
It is an arithmetic number, because the mean of its divisors is an integer number (28698808728).
Almost surely, 2110012100101 is an apocalyptic number.
It is an amenable number.
110012100101 is a deficient number, since it is larger than the sum of its proper divisors (4783134811).
110012100101 is an equidigital number, since it uses as much as digits as its factorization.
110012100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4783134810.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110012100101 its reverse (101001210011), we get a palindrome (211013310112).
It can be divided in two parts, 11001210010 and 1, that added together give a palindrome (11001210011).
The spelling of 110012100101 in words is "one hundred ten billion, twelve million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •