Base | Representation |
---|---|
bin | 100001110000111… |
… | …1110011111001001 |
3 | 2220221220100121111 |
4 | 1003201332133021 |
5 | 4310020331134 |
6 | 304231410321 |
7 | 40035113116 |
oct | 10341763711 |
9 | 2827810544 |
10 | 1132980169 |
11 | 5315a0852 |
12 | 2775239a1 |
13 | 15095a289 |
14 | aa68590d |
15 | 696ecc64 |
hex | 4387e7c9 |
1132980169 has 2 divisors, whose sum is σ = 1132980170. Its totient is φ = 1132980168.
The previous prime is 1132980139. The next prime is 1132980197. The reversal of 1132980169 is 9610892311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1124931600 + 8048569 = 33540^2 + 2837^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132980169 - 27 = 1132980041 is a prime.
It is a super-2 number, since 2×11329801692 = 2567288126694537122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1132980139) 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, 566490084 + 566490085.
It is an arithmetic number, because the mean of its divisors is an integer number (566490085).
Almost surely, 21132980169 is an apocalyptic number.
It is an amenable number.
1132980169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132980169 is an equidigital number, since it uses as much as digits as its factorization.
1132980169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 40.
The square root of 1132980169 is about 33659.7707805624. The cubic root of 1132980169 is about 1042.4952930297.
The spelling of 1132980169 in words is "one billion, one hundred thirty-two million, nine hundred eighty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •