Base | Representation |
---|---|
bin | 10100100000000111… |
… | …10110110011101101 |
3 | 1001102002100122201122 |
4 | 22100003312303231 |
5 | 140020224131441 |
6 | 5020111150325 |
7 | 536521543214 |
oct | 122003666355 |
9 | 31362318648 |
10 | 11006864621 |
11 | 47390a7335 |
12 | 21722153a5 |
13 | 106548c05c |
14 | 765b7a07b |
15 | 44649834b |
hex | 2900f6ced |
11006864621 has 2 divisors, whose sum is σ = 11006864622. Its totient is φ = 11006864620.
The previous prime is 11006864563. The next prime is 11006864629. The reversal of 11006864621 is 12646860011.
11006864621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10555302121 + 451562500 = 102739^2 + 21250^2 .
It is an emirp because it is prime and its reverse (12646860011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11006864621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11006864629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5503432310 + 5503432311.
It is an arithmetic number, because the mean of its divisors is an integer number (5503432311).
Almost surely, 211006864621 is an apocalyptic number.
It is an amenable number.
11006864621 is a deficient number, since it is larger than the sum of its proper divisors (1).
11006864621 is an equidigital number, since it uses as much as digits as its factorization.
11006864621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 35.
The spelling of 11006864621 in words is "eleven billion, six million, eight hundred sixty-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •