Base | Representation |
---|---|
bin | 11001000011110010000000… |
… | …110100010011111100101001 |
3 | 112110020001220121200200220121 |
4 | 121003302000310103330221 |
5 | 103421144133113342301 |
6 | 1030222124453523241 |
7 | 32133324603156115 |
oct | 3103620064237451 |
9 | 473201817620817 |
10 | 110211022012201 |
11 | 32131260804290 |
12 | 1043b774343521 |
13 | 4965b15c54236 |
14 | 1d30355bc2745 |
15 | cb1c956233a1 |
hex | 643c80d13f29 |
110211022012201 has 8 divisors (see below), whose sum is σ = 120621835170144. Its totient is φ = 99865480410720.
The previous prime is 110211022012199. The next prime is 110211022012207. The reversal of 110211022012201 is 102210220112011.
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 110211022012201 - 21 = 110211022012199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110211022012207) 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, 16317885580 + ... + 16317892333.
It is an arithmetic number, because the mean of its divisors is an integer number (15077729396268).
Almost surely, 2110211022012201 is an apocalyptic number.
110211022012201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110211022012201 is a deficient number, since it is larger than the sum of its proper divisors (10410813157943).
110211022012201 is a wasteful number, since it uses less digits than its factorization.
110211022012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32635778231.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110211022012201 its reverse (102210220112011), we get a palindrome (212421242124212).
The spelling of 110211022012201 in words is "one hundred ten trillion, two hundred eleven billion, twenty-two million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •