Base | Representation |
---|---|
bin | 10100100000100001… |
… | …00101100000101001 |
3 | 1001102022122012020222 |
4 | 22100100211200221 |
5 | 140022102423031 |
6 | 5020310455425 |
7 | 536562112145 |
oct | 122020454051 |
9 | 31368565228 |
10 | 11010201641 |
11 | 473aa764aa |
12 | 2173364575 |
13 | 1066089c1a |
14 | 7663a8225 |
15 | 446906e7b |
hex | 290425829 |
11010201641 has 2 divisors, whose sum is σ = 11010201642. Its totient is φ = 11010201640.
The previous prime is 11010201613. The next prime is 11010201647. The reversal of 11010201641 is 14610201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8386713241 + 2623488400 = 91579^2 + 51220^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010201641 - 26 = 11010201577 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 (11010201647) 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, 5505100820 + 5505100821.
It is an arithmetic number, because the mean of its divisors is an integer number (5505100821).
Almost surely, 211010201641 is an apocalyptic number.
It is an amenable number.
11010201641 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010201641 is an equidigital number, since it uses as much as digits as its factorization.
11010201641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11010201641 its reverse (14610201011), we get a palindrome (25620402652).
The spelling of 11010201641 in words is "eleven billion, ten million, two hundred one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •