Base | Representation |
---|---|
bin | 110011010100100011… |
… | …0011010001101001111 |
3 | 101112110210211122220212 |
4 | 1212221012122031033 |
5 | 3301203032241421 |
6 | 122344052433035 |
7 | 10651064563130 |
oct | 1465106321517 |
9 | 345423748825 |
10 | 110211212111 |
11 | 428163a0980 |
12 | 1943961877b |
13 | a5151ab6a0 |
14 | 5497283c87 |
15 | 2d00918e5b |
hex | 19a919a34f |
110211212111 has 32 divisors (see below), whose sum is σ = 149501549568. Its totient is φ = 78455485440.
The previous prime is 110211212101. The next prime is 110211212131. The reversal of 110211212111 is 111212112011.
It is a cyclic number.
It is not a de Polignac number, because 110211212111 - 210 = 110211211087 is a prime.
It is a super-2 number, since 2×1102112121112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110211212101) 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 31 ways as a sum of consecutive naturals, for example, 470435 + ... + 664628.
It is an arithmetic number, because the mean of its divisors is an integer number (4671923424).
Almost surely, 2110211212111 is an apocalyptic number.
110211212111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110211212111 is a deficient number, since it is larger than the sum of its proper divisors (39290337457).
110211212111 is a wasteful number, since it uses less digits than its factorization.
110211212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1135191.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110211212111 its reverse (111212112011), we get a palindrome (221423324122).
The spelling of 110211212111 in words is "one hundred ten billion, two hundred eleven million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •