Base | Representation |
---|---|
bin | 1010000110001110010000… |
… | …0101101110101110001001 |
3 | 1110022100021000102102201212 |
4 | 2201203210011232232021 |
5 | 2423343420140401301 |
6 | 35340110521222505 |
7 | 2224044313445252 |
oct | 241434405565611 |
9 | 43270230372655 |
10 | 11102022200201 |
11 | 35a0383114a49 |
12 | 12b3790931a35 |
13 | 626bbab8185a |
14 | 2a54aadcdb29 |
15 | 143bc81de4bb |
hex | a18e416eb89 |
11102022200201 has 4 divisors (see below), whose sum is σ = 11102612972052. Its totient is φ = 11101431428352.
The previous prime is 11102022200173. The next prime is 11102022200207. The reversal of 11102022200201 is 10200222020111.
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 5870056752400 + 5231965447801 = 2422820^2 + 2287349^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102022200201 - 230 = 11100948458377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11102022200207) 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, 295357736 + ... + 295395321.
It is an arithmetic number, because the mean of its divisors is an integer number (2775653243013).
Almost surely, 211102022200201 is an apocalyptic number.
It is an amenable number.
11102022200201 is a deficient number, since it is larger than the sum of its proper divisors (590771851).
11102022200201 is an equidigital number, since it uses as much as digits as its factorization.
11102022200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 590771850.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11102022200201 its reverse (10200222020111), we get a palindrome (21302244220312).
The spelling of 11102022200201 in words is "eleven trillion, one hundred two billion, twenty-two million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •