Base | Representation |
---|---|
bin | 1101001001000… |
… | …00101000001001 |
3 | 21200102110210020 |
4 | 12210200220021 |
5 | 211204442441 |
6 | 14534411053 |
7 | 2505655164 |
oct | 644405011 |
9 | 250373706 |
10 | 110234121 |
11 | 57251588 |
12 | 30b00a89 |
13 | 19ab7aba |
14 | 108d6adb |
15 | 9a26e66 |
hex | 6920a09 |
110234121 has 4 divisors (see below), whose sum is σ = 146978832. Its totient is φ = 73489412.
The previous prime is 110234087. The next prime is 110234141. The reversal of 110234121 is 121432011.
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 110234121 - 29 = 110233609 is a prime.
It is a super-2 number, since 2×1102341212 = 24303122865285282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110234121.
It is not an unprimeable number, because it can be changed into a prime (110234141) 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, 18372351 + ... + 18372356.
It is an arithmetic number, because the mean of its divisors is an integer number (36744708).
Almost surely, 2110234121 is an apocalyptic number.
It is an amenable number.
110234121 is a deficient number, since it is larger than the sum of its proper divisors (36744711).
110234121 is an equidigital number, since it uses as much as digits as its factorization.
110234121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36744710.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 110234121 is about 10499.2438299146. The cubic root of 110234121 is about 479.4816757361.
Adding to 110234121 its reverse (121432011), we get a palindrome (231666132).
The spelling of 110234121 in words is "one hundred ten million, two hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •