Base | Representation |
---|---|
bin | 110011010100010001… |
… | …1101100010011101011 |
3 | 101112110011201021211111 |
4 | 1212220203230103223 |
5 | 3301143220024321 |
6 | 122343125411151 |
7 | 10650624326653 |
oct | 1465043542353 |
9 | 345404637744 |
10 | 110202111211 |
11 | 42811245275 |
12 | 19436569ab7 |
13 | a51334313a |
14 | 5495d95363 |
15 | 2ceec1c5e1 |
hex | 19a88ec4eb |
110202111211 has 16 divisors (see below), whose sum is σ = 114418912608. Its totient is φ = 106066483200.
The previous prime is 110202111209. The next prime is 110202111221. The reversal of 110202111211 is 112111202011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110202111211 - 21 = 110202111209 is a prime.
It is a super-2 number, since 2×1102021112112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110202111191 and 110202111200.
It is not an unprimeable number, because it can be changed into a prime (110202111221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1005151 + ... + 1109383.
It is an arithmetic number, because the mean of its divisors is an integer number (7151182038).
Almost surely, 2110202111211 is an apocalyptic number.
110202111211 is a deficient number, since it is larger than the sum of its proper divisors (4216801397).
110202111211 is a wasteful number, since it uses less digits than its factorization.
110202111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104622.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110202111211 its reverse (112111202011), we get a palindrome (222313313222).
The spelling of 110202111211 in words is "one hundred ten billion, two hundred two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •