Base | Representation |
---|---|
bin | 110011010100001110… |
… | …0011111000110010101 |
3 | 101112110001011022110110 |
4 | 1212220130133012111 |
5 | 3301142224101401 |
6 | 122343021113233 |
7 | 10650602301234 |
oct | 1465034370625 |
9 | 345401138413 |
10 | 110200222101 |
11 | 42810174a22 |
12 | 194359b8819 |
13 | a512b31318 |
14 | 5495a22b1b |
15 | 2cee9979d6 |
hex | 19a871f195 |
110200222101 has 8 divisors (see below), whose sum is σ = 146935733440. Its totient is φ = 73465762752.
The previous prime is 110200222049. The next prime is 110200222103. The reversal of 110200222101 is 101222002011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110200222101 - 27 = 110200221973 is a prime.
It is a super-2 number, since 2×1102002221012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110200222103) 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 7 ways as a sum of consecutive naturals, for example, 27165 + ... + 470253.
It is an arithmetic number, because the mean of its divisors is an integer number (18366966680).
Almost surely, 2110200222101 is an apocalyptic number.
It is an amenable number.
110200222101 is a deficient number, since it is larger than the sum of its proper divisors (36735511339).
110200222101 is an equidigital number, since it uses as much as digits as its factorization.
110200222101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525995.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110200222101 its reverse (101222002011), we get a palindrome (211422224112).
The spelling of 110200222101 in words is "one hundred ten billion, two hundred million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •