Base | Representation |
---|---|
bin | 100001001110111… |
… | …1001110001000001 |
3 | 2212201022201200211 |
4 | 1002131321301001 |
5 | 4240433310131 |
6 | 302353114121 |
7 | 36430330366 |
oct | 10235716101 |
9 | 2781281624 |
10 | 1115135041 |
11 | 522512509 |
12 | 271558941 |
13 | 14a04c927 |
14 | a815c46d |
15 | 67d755b1 |
hex | 42779c41 |
1115135041 has 4 divisors (see below), whose sum is σ = 1126176084. Its totient is φ = 1104094000.
The previous prime is 1115135029. The next prime is 1115135051. The reversal of 1115135041 is 1405315111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 715295025 + 399840016 = 26745^2 + 19996^2 .
It is a cyclic number.
It is not a de Polignac number, because 1115135041 - 27 = 1115134913 is a prime.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1115135051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5520370 + ... + 5520571.
It is an arithmetic number, because the mean of its divisors is an integer number (281544021).
Almost surely, 21115135041 is an apocalyptic number.
It is an amenable number.
1115135041 is a deficient number, since it is larger than the sum of its proper divisors (11041043).
1115135041 is a wasteful number, since it uses less digits than its factorization.
1115135041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11041042.
The product of its (nonzero) digits is 300, while the sum is 22.
The square root of 1115135041 is about 33393.6377323585. The cubic root of 1115135041 is about 1036.9929908857.
The spelling of 1115135041 in words is "one billion, one hundred fifteen million, one hundred thirty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •