Base | Representation |
---|---|
bin | 10100111001100001… |
… | …11110110001100111 |
3 | 1001221221110002101102 |
4 | 22130300332301213 |
5 | 140434311122302 |
6 | 5053203550315 |
7 | 545020412345 |
oct | 123460766147 |
9 | 31857402342 |
10 | 11220020327 |
11 | 483845537a |
12 | 221168b39b |
13 | 109a6a13a9 |
14 | 7861c4995 |
15 | 45a050702 |
hex | 29cc3ec67 |
11220020327 has 2 divisors, whose sum is σ = 11220020328. Its totient is φ = 11220020326.
The previous prime is 11220020311. The next prime is 11220020347. The reversal of 11220020327 is 72302002211.
It is an a-pointer prime, because the next prime (11220020347) can be obtained adding 11220020327 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11220020327 - 24 = 11220020311 is a prime.
It is a super-2 number, since 2×112200203272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11220020299 and 11220020308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11220020347) 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, 5610010163 + 5610010164.
It is an arithmetic number, because the mean of its divisors is an integer number (5610010164).
Almost surely, 211220020327 is an apocalyptic number.
11220020327 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220020327 is an equidigital number, since it uses as much as digits as its factorization.
11220020327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 20.
Adding to 11220020327 its reverse (72302002211), we get a palindrome (83522022538).
The spelling of 11220020327 in words is "eleven billion, two hundred twenty million, twenty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •