Base | Representation |
---|---|
bin | 110011010100010001… |
… | …1101110111101110101 |
3 | 101112110011201211202211 |
4 | 1212220203232331311 |
5 | 3301143220401401 |
6 | 122343125533421 |
7 | 10650624403501 |
oct | 1465043567565 |
9 | 345404654684 |
10 | 110202122101 |
11 | 42811252475 |
12 | 19436574271 |
13 | a513348096 |
14 | 5495d99301 |
15 | 2ceec20951 |
hex | 19a88eef75 |
110202122101 has 4 divisors (see below), whose sum is σ = 110205900000. Its totient is φ = 110198344204.
The previous prime is 110202122071. The next prime is 110202122159. The reversal of 110202122101 is 101221202011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 101221202011 = 89363 ⋅1132697.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110202122101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110202122171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1844851 + ... + 1903648.
It is an arithmetic number, because the mean of its divisors is an integer number (27551475000).
Almost surely, 2110202122101 is an apocalyptic number.
It is an amenable number.
110202122101 is a deficient number, since it is larger than the sum of its proper divisors (3777899).
110202122101 is an equidigital number, since it uses as much as digits as its factorization.
110202122101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3777898.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110202122101 its reverse (101221202011), we get a palindrome (211423324112).
The spelling of 110202122101 in words is "one hundred ten billion, two hundred two million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •