Base | Representation |
---|---|
bin | 100010101000101… |
… | …0000100011100001 |
3 | 2222222210110001122 |
4 | 1011101100203201 |
5 | 4340002332121 |
6 | 311152542025 |
7 | 40541062502 |
oct | 10521204341 |
9 | 2888713048 |
10 | 1162152161 |
11 | 547006135 |
12 | 285251915 |
13 | 156a02401 |
14 | b04baba9 |
15 | 6c0615ab |
hex | 454508e1 |
1162152161 has 2 divisors, whose sum is σ = 1162152162. Its totient is φ = 1162152160.
The previous prime is 1162152133. The next prime is 1162152209. The reversal of 1162152161 is 1612512611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1106560225 + 55591936 = 33265^2 + 7456^2 .
It is a cyclic number.
It is not a de Polignac number, because 1162152161 - 226 = 1095043297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1162152161.
It is not a weakly prime, because it can be changed into another prime (1162155161) 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 as a sum of consecutive naturals, namely, 581076080 + 581076081.
It is an arithmetic number, because the mean of its divisors is an integer number (581076081).
Almost surely, 21162152161 is an apocalyptic number.
It is an amenable number.
1162152161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1162152161 is an equidigital number, since it uses as much as digits as its factorization.
1162152161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720, while the sum is 26.
The square root of 1162152161 is about 34090.3529022508. The cubic root of 1162152161 is about 1051.3669757473.
Adding to 1162152161 its reverse (1612512611), we get a palindrome (2774664772).
The spelling of 1162152161 in words is "one billion, one hundred sixty-two million, one hundred fifty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •