Base | Representation |
---|---|
bin | 100010100110100… |
… | …0010010010100001 |
3 | 2222220201012112100 |
4 | 1011031002102201 |
5 | 4334211421103 |
6 | 311113121013 |
7 | 40525502202 |
oct | 10515022241 |
9 | 2886635470 |
10 | 1161045153 |
11 | 54641a454 |
12 | 2849b9169 |
13 | 156705588 |
14 | b02ad5a9 |
15 | 6bde35a3 |
hex | 453424a1 |
1161045153 has 6 divisors (see below), whose sum is σ = 1677065234. Its totient is φ = 774030096.
The previous prime is 1161045121. The next prime is 1161045161. The reversal of 1161045153 is 3515401611.
1161045153 is a `hidden beast` number, since 1 + 1 + 610 + 45 + 1 + 5 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 616429584 + 544615569 = 24828^2 + 23337^2 .
It is not a de Polignac number, because 1161045153 - 25 = 1161045121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1161045113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 64502500 + ... + 64502517.
Almost surely, 21161045153 is an apocalyptic number.
It is an amenable number.
1161045153 is a deficient number, since it is larger than the sum of its proper divisors (516020081).
1161045153 is a wasteful number, since it uses less digits than its factorization.
1161045153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129005023 (or 129005020 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The square root of 1161045153 is about 34074.1126516891. The cubic root of 1161045153 is about 1051.0330431704.
Adding to 1161045153 its reverse (3515401611), we get a palindrome (4676446764).
The spelling of 1161045153 in words is "one billion, one hundred sixty-one million, forty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •