Base | Representation |
---|---|
bin | 110011010010011101… |
… | …0111111111111101101 |
3 | 101112021220221020001121 |
4 | 1212210322333333231 |
5 | 3301032111043201 |
6 | 122333110140541 |
7 | 10646254002403 |
oct | 1464472777755 |
9 | 345256836047 |
10 | 110141112301 |
11 | 4278a871950 |
12 | 1941a051751 |
13 | a5038065cc |
14 | 548bc37473 |
15 | 2ce96bd9a1 |
hex | 19a4ebffed |
110141112301 has 4 divisors (see below), whose sum is σ = 120153940704. Its totient is φ = 100128283900.
The previous prime is 110141112283. The next prime is 110141112307. The reversal of 110141112301 is 103211141011.
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 a cyclic number.
It is not a de Polignac number, because 110141112301 - 27 = 110141112173 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 (110141112307) 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, 5006414185 + ... + 5006414206.
It is an arithmetic number, because the mean of its divisors is an integer number (30038485176).
Almost surely, 2110141112301 is an apocalyptic number.
110141112301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110141112301 is a deficient number, since it is larger than the sum of its proper divisors (10012828403).
110141112301 is a wasteful number, since it uses less digits than its factorization.
110141112301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10012828402.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 110141112301 its reverse (103211141011), we get a palindrome (213352253312).
The spelling of 110141112301 in words is "one hundred ten billion, one hundred forty-one million, one hundred twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •