Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …0111100101101111011110 |
3 | 1102221210002101010010012012 |
4 | 2200012122113211233132 |
5 | 2420224044241321342 |
6 | 35222125522311222 |
7 | 2213603562342140 |
oct | 240063227455736 |
9 | 42853071103165 |
10 | 11002001120222 |
11 | 3561a168a1182 |
12 | 1298317ab8512 |
13 | 61a63aba1268 |
14 | 2a06dd242c90 |
15 | 1412c21ddb82 |
hex | a019a5e5bde |
11002001120222 has 64 divisors (see below), whose sum is σ = 20520711590400. Its totient is φ = 4319278058880.
The previous prime is 11002001120207. The next prime is 11002001120309. The reversal of 11002001120222 is 22202110020011.
It is a super-3 number, since 3×110020011202223 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 11002001120197 and 11002001120206.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4788833 + ... + 6703500.
It is an arithmetic number, because the mean of its divisors is an integer number (320636118600).
Almost surely, 211002001120222 is an apocalyptic number.
11002001120222 is a deficient number, since it is larger than the sum of its proper divisors (9518710470178).
11002001120222 is a wasteful number, since it uses less digits than its factorization.
11002001120222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11492481.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11002001120222 its reverse (22202110020011), we get a palindrome (33204111140233).
The spelling of 11002001120222 in words is "eleven trillion, two billion, one million, one hundred twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •