Base | Representation |
---|---|
bin | 10101000011001100… |
… | …00000100100010001 |
3 | 1002011120212210222122 |
4 | 22201212000210101 |
5 | 141121030431121 |
6 | 5105220144025 |
7 | 550023112541 |
oct | 124146004421 |
9 | 32146783878 |
10 | 11301030161 |
11 | 487a156253 |
12 | 2234838015 |
13 | 10b13c62c5 |
14 | 792c71321 |
15 | 4622035ab |
hex | 2a1980911 |
11301030161 has 2 divisors, whose sum is σ = 11301030162. Its totient is φ = 11301030160.
The previous prime is 11301030137. The next prime is 11301030173. The reversal of 11301030161 is 16103010311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6080100625 + 5220929536 = 77975^2 + 72256^2 .
It is a cyclic number.
It is not a de Polignac number, because 11301030161 - 222 = 11296835857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11301030101) 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, 5650515080 + 5650515081.
It is an arithmetic number, because the mean of its divisors is an integer number (5650515081).
Almost surely, 211301030161 is an apocalyptic number.
It is an amenable number.
11301030161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301030161 is an equidigital number, since it uses as much as digits as its factorization.
11301030161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11301030161 its reverse (16103010311), we get a palindrome (27404040472).
The spelling of 11301030161 in words is "eleven billion, three hundred one million, thirty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •