Base | Representation |
---|---|
bin | 1010000000110111011111… |
… | …0110101011011110011001 |
3 | 1102222112202200000002100202 |
4 | 2200031313312223132121 |
5 | 2420342001033032301 |
6 | 35225532451311545 |
7 | 2214306234614162 |
oct | 240156766533631 |
9 | 42875680002322 |
10 | 11010012002201 |
11 | 35653578213a3 |
12 | 12999928ab5b5 |
13 | 61b316754504 |
14 | 2a0c5d140769 |
15 | 1415e063866b |
hex | a0377dab799 |
11010012002201 has 4 divisors (see below), whose sum is σ = 11011884777600. Its totient is φ = 11008139226804.
The previous prime is 11010012002167. The next prime is 11010012002219. The reversal of 11010012002201 is 10220021001011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11010012002201 is a prime.
It is a super-2 number, since 2×110100120022012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010012002281) 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, 936378881 + ... + 936390638.
It is an arithmetic number, because the mean of its divisors is an integer number (2752971194400).
Almost surely, 211010012002201 is an apocalyptic number.
It is an amenable number.
11010012002201 is a deficient number, since it is larger than the sum of its proper divisors (1872775399).
11010012002201 is an equidigital number, since it uses as much as digits as its factorization.
11010012002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1872775398.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11010012002201 its reverse (10220021001011), we get a palindrome (21230033003212).
The spelling of 11010012002201 in words is "eleven trillion, ten billion, twelve million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •