Base | Representation |
---|---|
bin | 1010000001011101000110… |
… | …1111111010010111001001 |
3 | 1110000111211102101020002211 |
4 | 2200113101233322113021 |
5 | 2421023141142042301 |
6 | 35234322501025121 |
7 | 2215114413260131 |
oct | 240272157722711 |
9 | 43014742336084 |
10 | 11020110112201 |
11 | 3569669956953 |
12 | 129b9306b51a1 |
13 | 61c265873128 |
14 | 2a153a321ac1 |
15 | 1419d1e26051 |
hex | a05d1bfa5c9 |
11020110112201 has 8 divisors (see below), whose sum is σ = 11602925415200. Its totient is φ = 10437575760000.
The previous prime is 11020110112189. The next prime is 11020110112273. The reversal of 11020110112201 is 10221101102011.
It is a happy number.
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 11020110112201 - 241 = 8821086856649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020110112301) 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 7 ways as a sum of consecutive naturals, for example, 70157175 + ... + 70314076.
It is an arithmetic number, because the mean of its divisors is an integer number (1450365676900).
Almost surely, 211020110112201 is an apocalyptic number.
It is an amenable number.
11020110112201 is a deficient number, since it is larger than the sum of its proper divisors (582815302999).
11020110112201 is a wasteful number, since it uses less digits than its factorization.
11020110112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140475399.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11020110112201 its reverse (10221101102011), we get a palindrome (21241211214212).
The spelling of 11020110112201 in words is "eleven trillion, twenty billion, one hundred ten million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •