Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0000110000011010011 |
3 | 101201002110202111212222 |
4 | 1220103232012003103 |
5 | 3313334000001321 |
6 | 123241352411255 |
7 | 11043315202601 |
oct | 1502356060323 |
9 | 351073674788 |
10 | 112000000211 |
11 | 43554097950 |
12 | 198586a6b2b |
13 | a73b974398 |
14 | 55c6a7c871 |
15 | 2da79aa3ab |
hex | 1a13b860d3 |
112000000211 has 8 divisors (see below), whose sum is σ = 122306888304. Its totient is φ = 101713957120.
The previous prime is 112000000201. The next prime is 112000000213.
112000000211 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112000000211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112000000213) 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 7 ways as a sum of consecutive naturals, for example, 5200010 + ... + 5221503.
It is an arithmetic number, because the mean of its divisors is an integer number (15288361038).
Almost surely, 2112000000211 is an apocalyptic number.
112000000211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112000000211 is a deficient number, since it is larger than the sum of its proper divisors (10306888093).
112000000211 is a wasteful number, since it uses less digits than its factorization.
112000000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10422501.
The product of its (nonzero) digits is 4, while the sum is 8.
It can be divided in two parts, 112000000 and 211, that added together give a palindrome (112000211).
The spelling of 112000000211 in words is "one hundred twelve billion, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •