Base | Representation |
---|---|
bin | 100010100111000… |
… | …0111111111010001 |
3 | 2222221020201010222 |
4 | 1011032013333101 |
5 | 4334300040031 |
6 | 311123202425 |
7 | 40531101422 |
oct | 10516077721 |
9 | 2887221128 |
10 | 1161330641 |
11 | 5465a4999 |
12 | 284b16415 |
13 | 1567a54c3 |
14 | b0345649 |
15 | 6be4ce7b |
hex | 45387fd1 |
1161330641 has 2 divisors, whose sum is σ = 1161330642. Its totient is φ = 1161330640.
The previous prime is 1161330529. The next prime is 1161330671. The reversal of 1161330641 is 1460331611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1147854400 + 13476241 = 33880^2 + 3671^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1161330641 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1161330641.
It is not a weakly prime, because it can be changed into another prime (1161330671) 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 as a sum of consecutive naturals, namely, 580665320 + 580665321.
It is an arithmetic number, because the mean of its divisors is an integer number (580665321).
Almost surely, 21161330641 is an apocalyptic number.
It is an amenable number.
1161330641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1161330641 is an equidigital number, since it uses as much as digits as its factorization.
1161330641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 1161330641 is about 34078.3016155442. The cubic root of 1161330641 is about 1051.1191818621.
The spelling of 1161330641 in words is "one billion, one hundred sixty-one million, three hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •