Base | Representation |
---|---|
bin | 1010000111011001011011… |
… | …0001111011110111010001 |
3 | 1110101021100020111222012110 |
4 | 2201312112301323313101 |
5 | 2424211231200031001 |
6 | 35353245041415533 |
7 | 2225360325103614 |
oct | 241662661736721 |
9 | 43337306458173 |
10 | 11122200002001 |
11 | 35a8997a45100 |
12 | 12b768233a5a9 |
13 | 628a8534094a |
14 | 2a6462b5a17b |
15 | 1444a987c3d6 |
hex | a1d96c7bdd1 |
11122200002001 has 48 divisors (see below), whose sum is σ = 16534678104000. Its totient is φ = 6643929600000.
The previous prime is 11122200001933. The next prime is 11122200002033. The reversal of 11122200002001 is 10020000222111.
It is not a de Polignac number, because 11122200002001 - 221 = 11122197904849 is a prime.
It is a super-2 number, since 2×111222000020012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11122200002051) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 39582001 + ... + 39862001.
It is an arithmetic number, because the mean of its divisors is an integer number (344472460500).
Almost surely, 211122200002001 is an apocalyptic number.
11122200002001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11122200002001 is a deficient number, since it is larger than the sum of its proper divisors (5412478101999).
11122200002001 is a wasteful number, since it uses less digits than its factorization.
11122200002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281598 (or 281587 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11122200002001 its reverse (10020000222111), we get a palindrome (21142200224112).
The spelling of 11122200002001 in words is "eleven trillion, one hundred twenty-two billion, two hundred million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •