Base | Representation |
---|---|
bin | 100000111101111… |
… | …1110111101000011 |
3 | 2212002120222122121 |
4 | 1001323332331003 |
5 | 4231144242040 |
6 | 301434345111 |
7 | 36261625255 |
oct | 10173767503 |
9 | 2762528577 |
10 | 1106243395 |
11 | 51849a044 |
12 | 26a58b197 |
13 | 1482586ba |
14 | a6cc5cd5 |
15 | 671bac4a |
hex | 41efef43 |
1106243395 has 4 divisors (see below), whose sum is σ = 1327492080. Its totient is φ = 884994712.
The previous prime is 1106243323. The next prime is 1106243407. The reversal of 1106243395 is 5933426011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5933426011 = 69383 ⋅85517.
It is a cyclic number.
It is not a de Polignac number, because 1106243395 - 29 = 1106242883 is a prime.
It is a super-2 number, since 2×11062433952 = 2447548897962252050, 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 1106243395.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110624335 + ... + 110624344.
It is an arithmetic number, because the mean of its divisors is an integer number (331873020).
Almost surely, 21106243395 is an apocalyptic number.
1106243395 is a deficient number, since it is larger than the sum of its proper divisors (221248685).
1106243395 is an equidigital number, since it uses as much as digits as its factorization.
1106243395 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221248684.
The product of its (nonzero) digits is 19440, while the sum is 34.
The square root of 1106243395 is about 33260.2374465367. The cubic root of 1106243395 is about 1034.2294419422.
The spelling of 1106243395 in words is "one billion, one hundred six million, two hundred forty-three thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •