Base | Representation |
---|---|
bin | 1101001000111… |
… | …10110000111101 |
3 | 21200102002022201 |
4 | 12210132300331 |
5 | 211204221433 |
6 | 14534311501 |
7 | 2505624016 |
oct | 644366075 |
9 | 250362281 |
10 | 110226493 |
11 | 57246883 |
12 | 30ab8591 |
13 | 19ab44a0 |
14 | 108d400d |
15 | 9a24a7d |
hex | 691ec3d |
110226493 has 4 divisors (see below), whose sum is σ = 118705468. Its totient is φ = 101747520.
The previous prime is 110226481. The next prime is 110226497. The reversal of 110226493 is 394622011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53027524 + 57198969 = 7282^2 + 7563^2 .
It is a cyclic number.
It is not a de Polignac number, because 110226493 - 25 = 110226461 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 (110226497) 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, 4239468 + ... + 4239493.
It is an arithmetic number, because the mean of its divisors is an integer number (29676367).
Almost surely, 2110226493 is an apocalyptic number.
110226493 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110226493 is a deficient number, since it is larger than the sum of its proper divisors (8478975).
110226493 is an equidigital number, since it uses as much as digits as its factorization.
110226493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8478974.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 110226493 is about 10498.8805593739. The cubic root of 110226493 is about 479.4706157287.
The spelling of 110226493 in words is "one hundred ten million, two hundred twenty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •