Base | Representation |
---|---|
bin | 1010000000011010000110… |
… | …0001010100011010100001 |
3 | 1102221210101201220021212112 |
4 | 2200012201201110122201 |
5 | 2420224321001024301 |
6 | 35222145450205105 |
7 | 2213606550265103 |
oct | 240064141243241 |
9 | 42853351807775 |
10 | 11002121111201 |
11 | 3561a785a7180 |
12 | 1298350123795 |
13 | 61a6599c403c |
14 | 2a0711159573 |
15 | 1412cc9e19bb |
hex | a01a18546a1 |
11002121111201 has 8 divisors (see below), whose sum is σ = 12002790165600. Its totient is φ = 10001531427840.
The previous prime is 11002121111183. The next prime is 11002121111231. The reversal of 11002121111201 is 10211112120011.
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 11002121111201 - 210 = 11002121110177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11002121111231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19552736 + ... + 20107553.
It is an arithmetic number, because the mean of its divisors is an integer number (1500348770700).
Almost surely, 211002121111201 is an apocalyptic number.
11002121111201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11002121111201 is a deficient number, since it is larger than the sum of its proper divisors (1000669054399).
11002121111201 is a wasteful number, since it uses less digits than its factorization.
11002121111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39685519.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11002121111201 its reverse (10211112120011), we get a palindrome (21213233231212).
The spelling of 11002121111201 in words is "eleven trillion, two billion, one hundred twenty-one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •