Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …0111001101101110000101 |
3 | 1102222122212212020220202112 |
4 | 2200032333313031232011 |
5 | 2420401434321231041 |
6 | 35230252405150405 |
7 | 2214351204366116 |
oct | 240167767155605 |
9 | 42878785226675 |
10 | 11011220102021 |
11 | 356591775a6a7 |
12 | 129a06b3bb405 |
13 | 61b479b23689 |
14 | 2a0d3577c20d |
15 | 141661723deb |
hex | a03bfdcdb85 |
11011220102021 has 8 divisors (see below), whose sum is σ = 11012808203520. Its totient is φ = 11009632141872.
The previous prime is 11011220101979. The next prime is 11011220102083. The reversal of 11011220102021 is 12020102211011.
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 11011220102021 - 210 = 11011220100997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011220101987 and 11011220102005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011220102221) 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, 374733296 + ... + 374762678.
It is an arithmetic number, because the mean of its divisors is an integer number (1376601025440).
Almost surely, 211011220102021 is an apocalyptic number.
It is an amenable number.
11011220102021 is a deficient number, since it is larger than the sum of its proper divisors (1588101499).
11011220102021 is a wasteful number, since it uses less digits than its factorization.
11011220102021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70675.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11011220102021 its reverse (12020102211011), we get a palindrome (23031322313032).
The spelling of 11011220102021 in words is "eleven trillion, eleven billion, two hundred twenty million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •