Base | Representation |
---|---|
bin | 10100111001100001… |
… | …11100011111110001 |
3 | 1001221221102121120201 |
4 | 22130300330133301 |
5 | 140434310322433 |
6 | 5053203435201 |
7 | 545020343212 |
oct | 123460743761 |
9 | 31857377521 |
10 | 11220010993 |
11 | 4838449364 |
12 | 2211685b01 |
13 | 109a69a079 |
14 | 7861c1409 |
15 | 45a04ca7d |
hex | 29cc3c7f1 |
11220010993 has 2 divisors, whose sum is σ = 11220010994. Its totient is φ = 11220010992.
The previous prime is 11220010987. The next prime is 11220011053. The reversal of 11220010993 is 39901002211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8657930304 + 2562080689 = 93048^2 + 50617^2 .
It is a cyclic number.
It is not a de Polignac number, because 11220010993 - 229 = 10683140081 is a prime.
It is not a weakly prime, because it can be changed into another prime (11220010913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610005496 + 5610005497.
It is an arithmetic number, because the mean of its divisors is an integer number (5610005497).
Almost surely, 211220010993 is an apocalyptic number.
It is an amenable number.
11220010993 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220010993 is an equidigital number, since it uses as much as digits as its factorization.
11220010993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 28.
The spelling of 11220010993 in words is "eleven billion, two hundred twenty million, ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •