Base | Representation |
---|---|
bin | 100000111000000… |
… | …1101010001110101 |
3 | 2211212210011000021 |
4 | 1001300031101311 |
5 | 4224402000331 |
6 | 301244245141 |
7 | 36223450150 |
oct | 10160152165 |
9 | 2755704007 |
10 | 1103156341 |
11 | 516780761 |
12 | 2695407b1 |
13 | 147717541 |
14 | a6720c97 |
15 | 66cab211 |
hex | 41c0d475 |
1103156341 has 4 divisors (see below), whose sum is σ = 1260750112. Its totient is φ = 945562572.
The previous prime is 1103156339. The next prime is 1103156377. The reversal of 1103156341 is 1436513011.
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 1103156341 - 21 = 1103156339 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 (1103156141) 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, 78796875 + ... + 78796888.
It is an arithmetic number, because the mean of its divisors is an integer number (315187528).
Almost surely, 21103156341 is an apocalyptic number.
It is an amenable number.
1103156341 is a deficient number, since it is larger than the sum of its proper divisors (157593771).
1103156341 is an equidigital number, since it uses as much as digits as its factorization.
1103156341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157593770.
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 1103156341 is about 33213.7974492529. The cubic root of 1103156341 is about 1033.2665144330.
Adding to 1103156341 its reverse (1436513011), we get a palindrome (2539669352).
The spelling of 1103156341 in words is "one billion, one hundred three million, one hundred fifty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •