Base | Representation |
---|---|
bin | 110000000000000101010111… |
… | …111000110011101111110111 |
3 | 1000200111002222101211100211020 |
4 | 300000011113320303233313 |
5 | 210132324340003310403 |
6 | 2024555303112512223 |
7 | 62316224133054555 |
oct | 6000052770635767 |
9 | 1020432871740736 |
10 | 211112002010103 |
11 | 612a3108502177 |
12 | 1b816b063ab673 |
13 | 90a4a128ac09c |
14 | 3a1bc381dcbd5 |
15 | 196179349e453 |
hex | c00157e33bf7 |
211112002010103 has 8 divisors (see below), whose sum is σ = 281609864416368. Its totient is φ = 140677737138624.
The previous prime is 211112002010099. The next prime is 211112002010113. The reversal of 211112002010103 is 301010200211112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211112002010103 - 22 = 211112002010099 is a prime.
It is a super-2 number, since 2×2111120020101032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211112002010113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15899375950 + ... + 15899389227.
It is an arithmetic number, because the mean of its divisors is an integer number (35201233052046).
Almost surely, 2211112002010103 is an apocalyptic number.
211112002010103 is a deficient number, since it is larger than the sum of its proper divisors (70497862406265).
211112002010103 is a wasteful number, since it uses less digits than its factorization.
211112002010103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31798767393.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 211112002010103 its reverse (301010200211112), we get a palindrome (512122202221215).
The spelling of 211112002010103 in words is "two hundred eleven trillion, one hundred twelve billion, two million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •