Base | Representation |
---|---|
bin | 100001001111000… |
… | …1001111001010000 |
3 | 2212201110002022121 |
4 | 1002132021321100 |
5 | 4240442413404 |
6 | 302354344024 |
7 | 36431024113 |
oct | 10236117120 |
9 | 2781402277 |
10 | 1115201104 |
11 | 522558106 |
12 | 27158b014 |
13 | 14a073a14 |
14 | a817857a |
15 | 67d89e54 |
hex | 42789e50 |
1115201104 has 10 divisors (see below), whose sum is σ = 2160702170. Its totient is φ = 557600544.
The previous prime is 1115201089. The next prime is 1115201141. The reversal of 1115201104 is 4011025111.
It can be written as a sum of positive squares in only one way, i.e., 729000000 + 386201104 = 27000^2 + 19652^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 69700069 = 1115201104 / (1 + 1 + 1 + 5 + 2 + 0 + 1 + 1 + 0 + 4).
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 34850019 + ... + 34850050.
It is an arithmetic number, because the mean of its divisors is an integer number (216070217).
Almost surely, 21115201104 is an apocalyptic number.
It is an amenable number.
1115201104 is a deficient number, since it is larger than the sum of its proper divisors (1045501066).
1115201104 is an equidigital number, since it uses as much as digits as its factorization.
1115201104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69700077 (or 69700071 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 16.
The square root of 1115201104 is about 33394.6268731962. The cubic root of 1115201104 is about 1037.0134683802.
Adding to 1115201104 its reverse (4011025111), we get a palindrome (5126226215).
The spelling of 1115201104 in words is "one billion, one hundred fifteen million, two hundred one thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •