Base | Representation |
---|---|
bin | 100001001111110… |
… | …1011110010001101 |
3 | 2212202012110022212 |
4 | 1002133223302031 |
5 | 4241043231221 |
6 | 302411120205 |
7 | 36434314100 |
oct | 10237536215 |
9 | 2782173285 |
10 | 1115602061 |
11 | 522801382 |
12 | 271743065 |
13 | 14a184382 |
14 | a8240737 |
15 | 67e18b5b |
hex | 427ebc8d |
1115602061 has 6 divisors (see below), whose sum is σ = 1297741230. Its totient is φ = 956230296.
The previous prime is 1115602003. The next prime is 1115602121. The reversal of 1115602061 is 1602065111.
It can be written as a sum of positive squares in only one way, i.e., 576480100 + 539121961 = 24010^2 + 23219^2 .
It is not a de Polignac number, because 1115602061 - 26 = 1115601997 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 (1115602261) 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 5 ways as a sum of consecutive naturals, for example, 11383646 + ... + 11383743.
It is an arithmetic number, because the mean of its divisors is an integer number (216290205).
Almost surely, 21115602061 is an apocalyptic number.
It is an amenable number.
1115602061 is a deficient number, since it is larger than the sum of its proper divisors (182139169).
1115602061 is an equidigital number, since it uses as much as digits as its factorization.
1115602061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22767403 (or 22767396 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 23.
The square root of 1115602061 is about 33400.6296497536. The cubic root of 1115602061 is about 1037.1377353505.
Adding to 1115602061 its reverse (1602065111), we get a palindrome (2717667172).
The spelling of 1115602061 in words is "one billion, one hundred fifteen million, six hundred two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •