Base | Representation |
---|---|
bin | 1010000000011010000110… |
… | …0001010100001000000110 |
3 | 1102221210101201220020020212 |
4 | 2200012201201110020012 |
5 | 2420224321001010042 |
6 | 35222145450155422 |
7 | 2213606550261500 |
oct | 240064141241006 |
9 | 42853351806225 |
10 | 11002121110022 |
11 | 3561a785a62a9 |
12 | 1298350122b72 |
13 | 61a6599c3643 |
14 | 2a0711158d70 |
15 | 1412cc9e1482 |
hex | a01a1854206 |
11002121110022 has 12 divisors (see below), whose sum is σ = 19197578671740. Its totient is φ = 4715194761396.
The previous prime is 11002121110009. The next prime is 11002121110027. The reversal of 11002121110022 is 22001112120011.
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 = 11002121109979 and 11002121110006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002121110027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 56133270872 + ... + 56133271067.
It is an arithmetic number, because the mean of its divisors is an integer number (1599798222645).
Almost surely, 211002121110022 is an apocalyptic number.
11002121110022 is a deficient number, since it is larger than the sum of its proper divisors (8195457561718).
11002121110022 is a wasteful number, since it uses less digits than its factorization.
11002121110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112266541955 (or 112266541948 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11002121110022 its reverse (22001112120011), we get a palindrome (33003233230033).
The spelling of 11002121110022 in words is "eleven trillion, two billion, one hundred twenty-one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •