Base | Representation |
---|---|
bin | 1010000111011001011011… |
… | …0110001100110111001001 |
3 | 1110101021100022121210002021 |
4 | 2201312112312030313021 |
5 | 2424211231441321301 |
6 | 35353245121404441 |
7 | 2225360340441643 |
oct | 241662666146711 |
9 | 43337308553067 |
10 | 11122201120201 |
11 | 35a8998639236 |
12 | 12b7682799721 |
13 | 628a856428c2 |
14 | 2a6462d6b893 |
15 | 1444a99ed8a1 |
hex | a1d96d8cdc9 |
11122201120201 has 8 divisors (see below), whose sum is σ = 11123783510400. Its totient is φ = 11120618872272.
The previous prime is 11122201120139. The next prime is 11122201120241. The reversal of 11122201120201 is 10202110222111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11122201120201 - 27 = 11122201120073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11122201120241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 317550976 + ... + 317585998.
It is an arithmetic number, because the mean of its divisors is an integer number (1390472938800).
Almost surely, 211122201120201 is an apocalyptic number.
It is an amenable number.
11122201120201 is a deficient number, since it is larger than the sum of its proper divisors (1582390199).
11122201120201 is a wasteful number, since it uses less digits than its factorization.
11122201120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71135.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11122201120201 its reverse (10202110222111), we get a palindrome (21324311342312).
The spelling of 11122201120201 in words is "eleven trillion, one hundred twenty-two billion, two hundred one million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •