Base | Representation |
---|---|
bin | 1101001000111… |
… | …01100000010011 |
3 | 21200101211020112 |
4 | 12210131200103 |
5 | 211204040311 |
6 | 14534231535 |
7 | 2505602663 |
oct | 644354023 |
9 | 250354215 |
10 | 110221331 |
11 | 57242a10 |
12 | 30ab55ab |
13 | 19ab202c |
14 | 108d21a3 |
15 | 9a2328b |
hex | 691d813 |
110221331 has 4 divisors (see below), whose sum is σ = 120241464. Its totient is φ = 100201200.
The previous prime is 110221277. The next prime is 110221333. The reversal of 110221331 is 133122011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133122011 = 11 ⋅12102001.
It is not a de Polignac number, because 110221331 - 214 = 110204947 is a prime.
It is a super-2 number, since 2×1102213312 = 24297483614823122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110221333) 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, 5010050 + ... + 5010071.
It is an arithmetic number, because the mean of its divisors is an integer number (30060366).
Almost surely, 2110221331 is an apocalyptic number.
110221331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110221331 is a deficient number, since it is larger than the sum of its proper divisors (10020133).
110221331 is a wasteful number, since it uses less digits than its factorization.
110221331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10020132.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 110221331 is about 10498.6347207625. The cubic root of 110221331 is about 479.4631309402.
Adding to 110221331 its reverse (133122011), we get a palindrome (243343342).
The spelling of 110221331 in words is "one hundred ten million, two hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •