Base | Representation |
---|---|
bin | 110010000001100100010111… |
… | …111111010100001000100111 |
3 | 1001211222202112022012001122020 |
4 | 302001210113333110020213 |
5 | 212314121142131223421 |
6 | 2055531125021034223 |
7 | 64225130300613102 |
oct | 6201442777241047 |
9 | 1054882468161566 |
10 | 220010102211111 |
11 | 64113840057093 |
12 | 208135220b5973 |
13 | 959bb2c499114 |
14 | 3c4878d80d739 |
15 | 1a67e7ac72dc6 |
hex | c81917fd4227 |
220010102211111 has 8 divisors (see below), whose sum is σ = 303462209946480. Its totient is φ = 141615697974912.
The previous prime is 220010102211103. The next prime is 220010102211113. The reversal of 220010102211111 is 111112201010022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220010102211111 - 23 = 220010102211103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220010102211113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1264425874690 + ... + 1264425874863.
It is an arithmetic number, because the mean of its divisors is an integer number (37932776243310).
Almost surely, 2220010102211111 is an apocalyptic number.
220010102211111 is a deficient number, since it is larger than the sum of its proper divisors (83452107735369).
220010102211111 is a wasteful number, since it uses less digits than its factorization.
220010102211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2528851749585.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 220010102211111 its reverse (111112201010022), we get a palindrome (331122303221133).
The spelling of 220010102211111 in words is "two hundred twenty trillion, ten billion, one hundred two million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •