Base | Representation |
---|---|
bin | 1010000000110111111100… |
… | …0001010100011111101011 |
3 | 1102222120002001020101212121 |
4 | 2200031333001110133223 |
5 | 2420342222322412141 |
6 | 35225552424252111 |
7 | 2214312224553652 |
oct | 240157701243753 |
9 | 42876061211777 |
10 | 11010132232171 |
11 | 356540967aa06 |
12 | 1299a07011037 |
13 | 61b33562bcc7 |
14 | 2a0c710ba199 |
15 | 1415eae871d1 |
hex | a037f0547eb |
11010132232171 has 2 divisors, whose sum is σ = 11010132232172. Its totient is φ = 11010132232170.
The previous prime is 11010132232163. The next prime is 11010132232193. The reversal of 11010132232171 is 17123223101011.
It is a weak prime.
It is an emirp because it is prime and its reverse (17123223101011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11010132232171 - 23 = 11010132232163 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010132232471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505066116085 + 5505066116086.
It is an arithmetic number, because the mean of its divisors is an integer number (5505066116086).
Almost surely, 211010132232171 is an apocalyptic number.
11010132232171 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010132232171 is an equidigital number, since it uses as much as digits as its factorization.
11010132232171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 11010132232171 its reverse (17123223101011), we get a palindrome (28133355333182).
The spelling of 11010132232171 in words is "eleven trillion, ten billion, one hundred thirty-two million, two hundred thirty-two thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •