Base | Representation |
---|---|
bin | 1010000001100100111001… |
… | …1111101001110010010001 |
3 | 1110000201020021112001011212 |
4 | 2200121032133221302101 |
5 | 2421041432432031001 |
6 | 35235310302545505 |
7 | 2215220315451512 |
oct | 240311637516221 |
9 | 43021207461155 |
10 | 11022203002001 |
11 | 356a543278a44 |
12 | 12a0215598295 |
13 | 61c50a341869 |
14 | 2a169827aa09 |
15 | 141aa5a367bb |
hex | a064e7e9c91 |
11022203002001 has 4 divisors (see below), whose sum is σ = 11291037221604. Its totient is φ = 10753368782400.
The previous prime is 11022203001977. The next prime is 11022203002003. The reversal of 11022203002001 is 10020030222011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3866984596225 + 7155218405776 = 1966465^2 + 2674924^2 .
It is a cyclic number.
It is not a de Polignac number, because 11022203002001 - 230 = 11021129260177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11022203002003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134417109740 + ... + 134417109821.
It is an arithmetic number, because the mean of its divisors is an integer number (2822759305401).
Almost surely, 211022203002001 is an apocalyptic number.
It is an amenable number.
11022203002001 is a deficient number, since it is larger than the sum of its proper divisors (268834219603).
11022203002001 is an equidigital number, since it uses as much as digits as its factorization.
11022203002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268834219602.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 11022203002001 its reverse (10020030222011), we get a palindrome (21042233224012).
The spelling of 11022203002001 in words is "eleven trillion, twenty-two billion, two hundred three million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •