Base | Representation |
---|---|
bin | 1100110011110100010… |
… | …1001100001000110111 |
3 | 210001000220221221002210 |
4 | 3030331011030020313 |
5 | 12101144413241321 |
6 | 245033051104503 |
7 | 21620331003042 |
oct | 3147505141067 |
9 | 701026857083 |
10 | 220068102711 |
11 | 8536a785856 |
12 | 36798442133 |
13 | 179a1b4cb72 |
14 | a919453c59 |
15 | 5ad0193b76 |
hex | 333d14c237 |
220068102711 has 8 divisors (see below), whose sum is σ = 295664016384. Its totient is φ = 145592128760.
The previous prime is 220068102697. The next prime is 220068102713. The reversal of 220068102711 is 117201860022.
220068102711 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220068102711 - 211 = 220068100663 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220068102713) 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, 279984471 + ... + 279985256.
It is an arithmetic number, because the mean of its divisors is an integer number (36958002048).
Almost surely, 2220068102711 is an apocalyptic number.
220068102711 is a deficient number, since it is larger than the sum of its proper divisors (75595913673).
220068102711 is a wasteful number, since it uses less digits than its factorization.
220068102711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 559969861.
The product of its (nonzero) digits is 2688, while the sum is 30.
Adding to 220068102711 its reverse (117201860022), we get a palindrome (337269962733).
The spelling of 220068102711 in words is "two hundred twenty billion, sixty-eight million, one hundred two thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •