Base | Representation |
---|---|
bin | 100010010011101… |
… | …1001000101010001 |
3 | 2222020010212000201 |
4 | 1010213121011101 |
5 | 4324200131131 |
6 | 310121415201 |
7 | 40345562200 |
oct | 10447310521 |
9 | 2866125021 |
10 | 1151177041 |
11 | 54089a393 |
12 | 28163a501 |
13 | 15465ba61 |
14 | acc61237 |
15 | 6b0e4761 |
hex | 449d9151 |
1151177041 has 27 divisors (see below), whose sum is σ = 1386881307. Its totient is φ = 952726320.
The previous prime is 1151177021. The next prime is 1151177051. The reversal of 1151177041 is 1407711511.
The square root of 1151177041 is 33929.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 1030089025 + 121088016 = 32095^2 + 11004^2 .
It is not a de Polignac number, because 1151177041 - 25 = 1151177009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1151177021) 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 in 26 ways as a sum of consecutive naturals, for example, 8787546 + ... + 8787676.
Almost surely, 21151177041 is an apocalyptic number.
1151177041 is the 33929-th square number.
1151177041 is the 16965-th centered octagonal number.
It is an amenable number.
1151177041 is a deficient number, since it is larger than the sum of its proper divisors (235704266).
1151177041 is an frugal number, since it uses more digits than its factorization.
1151177041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350 (or 175 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 28.
The cubic root of 1151177041 is about 1048.0468729035.
Adding to 1151177041 its reverse (1407711511), we get a palindrome (2558888552).
The spelling of 1151177041 in words is "one billion, one hundred fifty-one million, one hundred seventy-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •