Base | Representation |
---|---|
bin | 11001000010010100001000… |
… | …100111000000010010110101 |
3 | 112102212102201121211020100110 |
4 | 121002110020213000102311 |
5 | 103413021213034310401 |
6 | 1030103534234333233 |
7 | 32123125631611404 |
oct | 3102241047002265 |
9 | 472772647736313 |
10 | 110110221010101 |
11 | 320a2534213484 |
12 | 1042412228a219 |
13 | 4959470500770 |
14 | 1d2951261563b |
15 | cae345e149d6 |
hex | 6425089c04b5 |
110110221010101 has 16 divisors (see below), whose sum is σ = 158201715674240. Its totient is φ = 67719536723520.
The previous prime is 110110221010079. The next prime is 110110221010103. The reversal of 110110221010101 is 101010122011011.
It is not a de Polignac number, because 110110221010101 - 213 = 110110221001909 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110221010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 845752465 + ... + 845882646.
It is an arithmetic number, because the mean of its divisors is an integer number (9887607229640).
Almost surely, 2110110221010101 is an apocalyptic number.
It is an amenable number.
110110221010101 is a deficient number, since it is larger than the sum of its proper divisors (48091494664139).
110110221010101 is a wasteful number, since it uses less digits than its factorization.
110110221010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691636796.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110110221010101 its reverse (101010122011011), we get a palindrome (211120343021112).
The spelling of 110110221010101 in words is "one hundred ten trillion, one hundred ten billion, two hundred twenty-one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •