Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …0110100111100110110011 |
3 | 1102221200112101001022021011 |
4 | 2200011133112213212303 |
5 | 2420220032304304341 |
6 | 35221443353011351 |
7 | 2213540210501263 |
oct | 240053726474663 |
9 | 42850471038234 |
10 | 11001011009971 |
11 | 3561558a12744 |
12 | 12980a03b3b57 |
13 | 61a510a176c8 |
14 | 2a064794b7a3 |
15 | 141265312b81 |
hex | a015f5a79b3 |
11001011009971 has 2 divisors, whose sum is σ = 11001011009972. Its totient is φ = 11001011009970.
The previous prime is 11001011009953. The next prime is 11001011010023. The reversal of 11001011009971 is 17990011010011.
It is a weak prime.
It is an emirp because it is prime and its reverse (17990011010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001011009971 - 25 = 11001011009939 is a prime.
It is a super-2 number, since 2×110010110099712 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11001011009071) 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, 5500505504985 + 5500505504986.
It is an arithmetic number, because the mean of its divisors is an integer number (5500505504986).
Almost surely, 211001011009971 is an apocalyptic number.
11001011009971 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001011009971 is an equidigital number, since it uses as much as digits as its factorization.
11001011009971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 31.
Adding to 11001011009971 its reverse (17990011010011), we get a palindrome (28991022019982).
The spelling of 11001011009971 in words is "eleven trillion, one billion, eleven million, nine thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •