Base | Representation |
---|---|
bin | 100001001110110… |
… | …0010100011000101 |
3 | 2212201010220020121 |
4 | 1002131202203011 |
5 | 4240422234231 |
6 | 302351101541 |
7 | 36426453211 |
oct | 10235424305 |
9 | 2781126217 |
10 | 1115039941 |
11 | 522458014 |
12 | 2715118b1 |
13 | 14a018562 |
14 | a8135941 |
15 | 67d57311 |
hex | 427628c5 |
1115039941 has 2 divisors, whose sum is σ = 1115039942. Its totient is φ = 1115039940.
The previous prime is 1115039927. The next prime is 1115040007. The reversal of 1115039941 is 1499305111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1078859716 + 36180225 = 32846^2 + 6015^2 .
It is a cyclic number.
It is not a de Polignac number, because 1115039941 - 211 = 1115037893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1115039897 and 1115039906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1115039641) 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 as a sum of consecutive naturals, namely, 557519970 + 557519971.
It is an arithmetic number, because the mean of its divisors is an integer number (557519971).
Almost surely, 21115039941 is an apocalyptic number.
It is an amenable number.
1115039941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115039941 is an equidigital number, since it uses as much as digits as its factorization.
1115039941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 34.
The square root of 1115039941 is about 33392.2137780651. The cubic root of 1115039941 is about 1036.9635113956.
The spelling of 1115039941 in words is "one billion, one hundred fifteen million, thirty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •