Base | Representation |
---|---|
bin | 11001000011110011000001… |
… | …101011011111101011101011 |
3 | 112110020011201110100101101120 |
4 | 121003303001223133223223 |
5 | 103421203400204020021 |
6 | 1030222424445550323 |
7 | 32133363555606462 |
oct | 3103630153375353 |
9 | 473204643311346 |
10 | 110212110220011 |
11 | 32131769aa4988 |
12 | 1043ba188753a3 |
13 | 4965c5a536697 |
14 | 1d3041a5319d9 |
15 | cb1d0ae2a2c6 |
hex | 643cc1adfaeb |
110212110220011 has 8 divisors (see below), whose sum is σ = 146972366081424. Its totient is φ = 73463297252640.
The previous prime is 110212110219973. The next prime is 110212110220021. The reversal of 110212110220011 is 110022011212011.
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 110212110220011 - 215 = 110212110187243 is a prime.
It is a super-2 number, since 2×1102121102200112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110212110220021) 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, 2860701036 + ... + 2860739561.
It is an arithmetic number, because the mean of its divisors is an integer number (18371545760178).
Almost surely, 2110212110220011 is an apocalyptic number.
110212110220011 is a deficient number, since it is larger than the sum of its proper divisors (36760255861413).
110212110220011 is an equidigital number, since it uses as much as digits as its factorization.
110212110220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5721447021.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110212110220011 its reverse (110022011212011), we get a palindrome (220234121432022).
The spelling of 110212110220011 in words is "one hundred ten trillion, two hundred twelve billion, one hundred ten million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •