Base | Representation |
---|---|
bin | 1101001000000… |
… | …01000111000111 |
3 | 21200011220201010 |
4 | 12210001013013 |
5 | 211141330111 |
6 | 14531533303 |
7 | 2504606631 |
oct | 644010707 |
9 | 250156633 |
10 | 110105031 |
11 | 571735a3 |
12 | 30a5a233 |
13 | 19a7110a |
14 | 108a1a51 |
15 | 99edaa6 |
hex | 69011c7 |
110105031 has 4 divisors (see below), whose sum is σ = 146806712. Its totient is φ = 73403352.
The previous prime is 110105027. The next prime is 110105077. The reversal of 110105031 is 130501011.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 110105031 - 22 = 110105027 is a prime.
It is a super-2 number, since 2×1101050312 = 24246235703021922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110104998 and 110105016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110105011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18350836 + ... + 18350841.
It is an arithmetic number, because the mean of its divisors is an integer number (36701678).
Almost surely, 2110105031 is an apocalyptic number.
110105031 is a deficient number, since it is larger than the sum of its proper divisors (36701681).
110105031 is an equidigital number, since it uses as much as digits as its factorization.
110105031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36701680.
The product of its (nonzero) digits is 15, while the sum is 12.
The square root of 110105031 is about 10493.0944434900. The cubic root of 110105031 is about 479.2944364737.
Adding to 110105031 its reverse (130501011), we get a palindrome (240606042).
The spelling of 110105031 in words is "one hundred ten million, one hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •