Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …0100011010110111101101 |
3 | 1110022011001002200021221210 |
4 | 2201201223210122313231 |
5 | 2423330300022432341 |
6 | 35335134130545033 |
7 | 2223643231653360 |
oct | 241415344326755 |
9 | 43264032607853 |
10 | 11100000202221 |
11 | 359a535812a37 |
12 | 12b3307738179 |
13 | 626957ca4848 |
14 | 2a535864a0d7 |
15 | 143b0a933c16 |
hex | a186b91aded |
11100000202221 has 64 divisors (see below), whose sum is σ = 17858664345600. Its totient is φ = 5990754816000.
The previous prime is 11100000202219. The next prime is 11100000202231. The reversal of 11100000202221 is 12220200000111.
It is not a de Polignac number, because 11100000202221 - 21 = 11100000202219 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11100000202197 and 11100000202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100000202231) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 770772621 + ... + 770787021.
It is an arithmetic number, because the mean of its divisors is an integer number (279041630400).
Almost surely, 211100000202221 is an apocalyptic number.
It is an amenable number.
11100000202221 is a deficient number, since it is larger than the sum of its proper divisors (6758664143379).
11100000202221 is a wasteful number, since it uses less digits than its factorization.
11100000202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20170.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11100000202221 its reverse (12220200000111), we get a palindrome (23320200202332).
The spelling of 11100000202221 in words is "eleven trillion, one hundred billion, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •