Base | Representation |
---|---|
bin | 100000111001101… |
… | …1100111110100101 |
3 | 2211221101101000000 |
4 | 1001303130332211 |
5 | 4230111211302 |
6 | 301314411513 |
7 | 36233622345 |
oct | 10163347645 |
9 | 2757341000 |
10 | 1104007077 |
11 | 517201948 |
12 | 269890b99 |
13 | 147954834 |
14 | a68a2d25 |
15 | 66dc831c |
hex | 41cdcfa5 |
1104007077 has 14 divisors (see below), whose sum is σ = 1655254502. Its totient is φ = 736004232.
The previous prime is 1104007049. The next prime is 1104007087. The reversal of 1104007077 is 7707004011.
It can be written as a sum of positive squares in only one way, i.e., 768897441 + 335109636 = 27729^2 + 18306^2 .
It is not a de Polignac number, because 1104007077 - 216 = 1103941541 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1104007077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104007087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 756478 + ... + 757935.
Almost surely, 21104007077 is an apocalyptic number.
It is an amenable number.
1104007077 is a deficient number, since it is larger than the sum of its proper divisors (551247425).
1104007077 is an frugal number, since it uses more digits than its factorization.
1104007077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514431 (or 1514416 counting only the distinct ones).
The product of its (nonzero) digits is 1372, while the sum is 27.
The square root of 1104007077 is about 33226.6019478369. The cubic root of 1104007077 is about 1033.5320588891.
The spelling of 1104007077 in words is "one billion, one hundred four million, seven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •