Base | Representation |
---|---|
bin | 1101001000010… |
… | …00001100001111 |
3 | 21200020101111012 |
4 | 12210020030033 |
5 | 211143242111 |
6 | 14532315435 |
7 | 2505060320 |
oct | 644101417 |
9 | 250211435 |
10 | 110134031 |
11 | 57193367 |
12 | 30a72b7b |
13 | 19a81387 |
14 | 108ac447 |
15 | 9a0748b |
hex | 690830f |
110134031 has 8 divisors (see below), whose sum is σ = 126370944. Its totient is φ = 94023000.
The previous prime is 110134001. The next prime is 110134039. The reversal of 110134031 is 130431011.
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 110134031 - 210 = 110133007 is a prime.
It is a super-2 number, since 2×1101340312 = 24259009568617922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110133997 and 110134015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110134039) 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 7 ways as a sum of consecutive naturals, for example, 29585 + ... + 33098.
It is an arithmetic number, because the mean of its divisors is an integer number (15796368).
Almost surely, 2110134031 is an apocalyptic number.
110134031 is a deficient number, since it is larger than the sum of its proper divisors (16236913).
110134031 is an equidigital number, since it uses as much as digits as its factorization.
110134031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62941.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 110134031 is about 10494.4762137040. The cubic root of 110134031 is about 479.3365124152.
Adding to 110134031 its reverse (130431011), we get a palindrome (240565042).
The spelling of 110134031 in words is "one hundred ten million, one hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •