Base | Representation |
---|---|
bin | 1010000001100100111100… |
… | …0010000001010001011101 |
3 | 1110000201020220110202100020 |
4 | 2200121033002001101131 |
5 | 2421041442233323401 |
6 | 35235311224022353 |
7 | 2215220455153224 |
oct | 240311702012135 |
9 | 43021226422306 |
10 | 11022212011101 |
11 | 356a548371685 |
12 | 12a02186019b9 |
13 | 61c50c1773a5 |
14 | 2a1699543cbb |
15 | 141aa6715d36 |
hex | a064f08145d |
11022212011101 has 8 divisors (see below), whose sum is σ = 14697884842080. Its totient is φ = 7347340260432.
The previous prime is 11022212011073. The next prime is 11022212011121. The reversal of 11022212011101 is 10111021222011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11022212011101 - 218 = 11022211748957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022212011121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200237971 + ... + 200293008.
It is an arithmetic number, because the mean of its divisors is an integer number (1837235605260).
Almost surely, 211022212011101 is an apocalyptic number.
It is an amenable number.
11022212011101 is a deficient number, since it is larger than the sum of its proper divisors (3675672830979).
11022212011101 is an equidigital number, since it uses as much as digits as its factorization.
11022212011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400540155.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11022212011101 its reverse (10111021222011), we get a palindrome (21133233233112).
The spelling of 11022212011101 in words is "eleven trillion, twenty-two billion, two hundred twelve million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •