Base | Representation |
---|---|
bin | 101010010110… |
… | …010001111011 |
3 | 202220000010112 |
4 | 222112101323 |
5 | 10320220212 |
6 | 1033534535 |
7 | 163234220 |
oct | 52262173 |
9 | 22800115 |
10 | 11101307 |
11 | 62a2638 |
12 | 387444b |
13 | 23b8c29 |
14 | 168d947 |
15 | e94422 |
hex | a9647b |
11101307 has 4 divisors (see below), whose sum is σ = 12687216. Its totient is φ = 9515400.
The previous prime is 11101303. The next prime is 11101331. The reversal of 11101307 is 70310111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70310111 = 5099 ⋅13789.
It is a cyclic number.
It is not a de Polignac number, because 11101307 - 22 = 11101303 is a prime.
It is a Duffinian number.
It is a nialpdrome in base 15.
It is a junction number, because it is equal to n+sod(n) for n = 11101291 and 11101300.
It is not an unprimeable number, because it can be changed into a prime (11101303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 792944 + ... + 792957.
It is an arithmetic number, because the mean of its divisors is an integer number (3171804).
Almost surely, 211101307 is an apocalyptic number.
11101307 is a deficient number, since it is larger than the sum of its proper divisors (1585909).
11101307 is an equidigital number, since it uses as much as digits as its factorization.
11101307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1585908.
The product of its (nonzero) digits is 21, while the sum is 14.
The square root of 11101307 is about 3331.8623921165. The cubic root of 11101307 is about 223.0786654305.
Adding to 11101307 its reverse (70310111), we get a palindrome (81411418).
The spelling of 11101307 in words is "eleven million, one hundred one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •